./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Collatz_bounded.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 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/Collatz_bounded.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 fb8f212b8045dc9be8518316cbae752ce6111a4a93244dc89f86b0ea27a978ef --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:39:19,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:39:19,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:39:19,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:39:19,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:39:19,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:39:19,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:39:19,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:39:19,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:39:19,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:39:19,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:39:19,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:39:19,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:39:19,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:39:19,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:39:19,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:39:19,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:39:19,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:39:19,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:39:19,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:39:19,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:39:19,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:39:19,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:39:19,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:39:19,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:39:19,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:39:19,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:39:19,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:39:19,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:39:19,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:39:19,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:39:19,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:39:19,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:39:19,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:39:19,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:39:19,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:39:19,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:39:19,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:39:19,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:39:19,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:39:19,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:39:19,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:39:19,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-07-14 13:39:20,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:39:20,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:39:20,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:39:20,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:39:20,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:39:20,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:39:20,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:39:20,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:39:20,019 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:39:20,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:39:20,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:39:20,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:39:20,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:39:20,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:39:20,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:39:20,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:39:20,021 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:39:20,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:39:20,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:39:20,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:39:20,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:39:20,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:39:20,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:39:20,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:39:20,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:39:20,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:39:20,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:39:20,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:39:20,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:39:20,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:39:20,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8f212b8045dc9be8518316cbae752ce6111a4a93244dc89f86b0ea27a978ef [2022-07-14 13:39:20,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:39:20,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:39:20,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:39:20,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:39:20,264 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:39:20,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Collatz_bounded.c [2022-07-14 13:39:20,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf7bc25f/e2e61a1d1c9e4c56ac6cda1df2d30474/FLAG7813bf0a2 [2022-07-14 13:39:20,637 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:39:20,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Collatz_bounded.c [2022-07-14 13:39:20,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf7bc25f/e2e61a1d1c9e4c56ac6cda1df2d30474/FLAG7813bf0a2 [2022-07-14 13:39:21,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf7bc25f/e2e61a1d1c9e4c56ac6cda1df2d30474 [2022-07-14 13:39:21,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:39:21,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:39:21,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:39:21,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:39:21,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:39:21,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a4bebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21, skipping insertion in model container [2022-07-14 13:39:21,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:39:21,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:39:21,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:39:21,241 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:39:21,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:39:21,264 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:39:21,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21 WrapperNode [2022-07-14 13:39:21,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:39:21,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:39:21,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:39:21,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:39:21,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,287 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-07-14 13:39:21,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:39:21,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:39:21,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:39:21,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:39:21,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:39:21,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:39:21,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:39:21,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:39:21,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (1/1) ... [2022-07-14 13:39:21,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:39:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:39:21,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 13:39:21,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 13:39:21,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:39:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:39:21,393 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:39:21,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:39:21,468 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:39:21,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:39:21,472 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 13:39:21,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:39:21 BoogieIcfgContainer [2022-07-14 13:39:21,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:39:21,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:39:21,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:39:21,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:39:21,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:39:21" (1/3) ... [2022-07-14 13:39:21,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d51b316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:39:21, skipping insertion in model container [2022-07-14 13:39:21,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:39:21" (2/3) ... [2022-07-14 13:39:21,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d51b316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:39:21, skipping insertion in model container [2022-07-14 13:39:21,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:39:21" (3/3) ... [2022-07-14 13:39:21,480 INFO L111 eAbstractionObserver]: Analyzing ICFG Collatz_bounded.c [2022-07-14 13:39:21,489 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:39:21,489 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-07-14 13:39:21,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:39:21,521 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2968d8a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b70138a [2022-07-14 13:39:21,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-14 13:39:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 13:39:21,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:21,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 13:39:21,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash 889575245, now seen corresponding path program 1 times [2022-07-14 13:39:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:21,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835130478] [2022-07-14 13:39:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835130478] [2022-07-14 13:39:21,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835130478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:39:21,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:39:21,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:39:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578096091] [2022-07-14 13:39:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:39:21,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:39:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:39:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:39:21,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:39:21,731 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:39:21,870 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-14 13:39:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:39:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 13:39:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:39:21,877 INFO L225 Difference]: With dead ends: 42 [2022-07-14 13:39:21,877 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 13:39:21,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:39:21,883 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:39:21,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:39:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 13:39:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 13:39:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-14 13:39:21,919 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 6 [2022-07-14 13:39:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:39:21,919 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-14 13:39:21,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-14 13:39:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 13:39:21,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:21,920 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:39:21,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:39:21,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -149178656, now seen corresponding path program 1 times [2022-07-14 13:39:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:21,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502077131] [2022-07-14 13:39:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502077131] [2022-07-14 13:39:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502077131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:39:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737960331] [2022-07-14 13:39:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:22,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:22,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:39:22,014 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) [2022-07-14 13:39:22,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 13:39:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:22,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:39:22,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:39:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:22,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:39:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:22,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737960331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:39:22,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:39:22,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2022-07-14 13:39:22,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125622119] [2022-07-14 13:39:22,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:39:22,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 13:39:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:39:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 13:39:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:39:22,232 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:39:22,322 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-07-14 13:39:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:39:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 13:39:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:39:22,323 INFO L225 Difference]: With dead ends: 45 [2022-07-14 13:39:22,324 INFO L226 Difference]: Without dead ends: 39 [2022-07-14 13:39:22,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:39:22,327 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:39:22,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 5 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:39:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-14 13:39:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-07-14 13:39:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-07-14 13:39:22,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-07-14 13:39:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:39:22,341 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-07-14 13:39:22,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-07-14 13:39:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 13:39:22,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:22,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 13:39:22,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 13:39:22,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:22,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash 54680819, now seen corresponding path program 1 times [2022-07-14 13:39:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:22,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184251066] [2022-07-14 13:39:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184251066] [2022-07-14 13:39:22,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184251066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:39:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887444736] [2022-07-14 13:39:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:39:22,618 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) [2022-07-14 13:39:22,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 13:39:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:22,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:39:22,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:39:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:22,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:39:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887444736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:39:22,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:39:22,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 13:39:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969023967] [2022-07-14 13:39:22,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:39:22,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 13:39:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:39:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 13:39:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:39:22,794 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:39:22,887 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2022-07-14 13:39:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:39:22,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 13:39:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:39:22,891 INFO L225 Difference]: With dead ends: 62 [2022-07-14 13:39:22,891 INFO L226 Difference]: Without dead ends: 60 [2022-07-14 13:39:22,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:39:22,894 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:39:22,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 6 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:39:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-14 13:39:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-14 13:39:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 59 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2022-07-14 13:39:22,910 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 18 [2022-07-14 13:39:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:39:22,910 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2022-07-14 13:39:22,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2022-07-14 13:39:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 13:39:22,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:22,911 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 13:39:22,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 13:39:23,128 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,SelfDestructingSolverStorable2 [2022-07-14 13:39:23,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1695099490, now seen corresponding path program 1 times [2022-07-14 13:39:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:23,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63275401] [2022-07-14 13:39:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:39:23,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63275401] [2022-07-14 13:39:23,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63275401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:39:23,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:39:23,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:39:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010593880] [2022-07-14 13:39:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:39:23,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:39:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:39:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:39:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:39:23,165 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:39:23,190 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-07-14 13:39:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:39:23,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 13:39:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:39:23,191 INFO L225 Difference]: With dead ends: 66 [2022-07-14 13:39:23,192 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 13:39:23,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:39:23,192 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:39:23,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:39:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 13:39:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-07-14 13:39:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-07-14 13:39:23,198 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 19 [2022-07-14 13:39:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:39:23,198 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-07-14 13:39:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-07-14 13:39:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 13:39:23,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:23,199 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1] [2022-07-14 13:39:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:39:23,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1243190337, now seen corresponding path program 2 times [2022-07-14 13:39:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578870827] [2022-07-14 13:39:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578870827] [2022-07-14 13:39:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578870827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:39:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487419903] [2022-07-14 13:39:23,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:39:23,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:39:23,272 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) [2022-07-14 13:39:23,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 13:39:23,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:39:23,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:39:23,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:39:23,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:39:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:23,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:39:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487419903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:39:23,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:39:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-07-14 13:39:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262028174] [2022-07-14 13:39:23,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:39:23,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 13:39:23,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:39:23,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 13:39:23,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-07-14 13:39:23,468 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:39:23,658 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2022-07-14 13:39:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 13:39:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 42 [2022-07-14 13:39:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:39:23,662 INFO L225 Difference]: With dead ends: 122 [2022-07-14 13:39:23,663 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 13:39:23,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-07-14 13:39:23,665 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 91 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:39:23,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 7 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:39:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 13:39:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2022-07-14 13:39:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.150943396226415) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-07-14 13:39:23,677 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 42 [2022-07-14 13:39:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:39:23,678 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-07-14 13:39:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-07-14 13:39:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 13:39:23,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:23,679 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1] [2022-07-14 13:39:23,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-14 13:39:23,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:23,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1207498149, now seen corresponding path program 3 times [2022-07-14 13:39:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171359470] [2022-07-14 13:39:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-14 13:39:24,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:24,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171359470] [2022-07-14 13:39:24,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171359470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:39:24,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050060928] [2022-07-14 13:39:24,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:39:24,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:39:24,044 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) [2022-07-14 13:39:24,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 13:39:24,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 13:39:24,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:39:24,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:39:24,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:39:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-07-14 13:39:24,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:39:24,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050060928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:39:24,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:39:24,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-14 13:39:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649301829] [2022-07-14 13:39:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:39:24,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:39:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:39:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:39:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:39:24,143 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:39:24,175 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2022-07-14 13:39:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:39:24,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 54 [2022-07-14 13:39:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:39:24,176 INFO L225 Difference]: With dead ends: 209 [2022-07-14 13:39:24,176 INFO L226 Difference]: Without dead ends: 117 [2022-07-14 13:39:24,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:39:24,177 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:39:24,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:39:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-14 13:39:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-07-14 13:39:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1122448979591837) internal successors, (109), 98 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) [2022-07-14 13:39:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-07-14 13:39:24,186 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 54 [2022-07-14 13:39:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:39:24,187 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-07-14 13:39:24,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:39:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-07-14 13:39:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-14 13:39:24,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:39:24,188 INFO L195 NwaCegarLoop]: trace histogram [19, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2022-07-14 13:39:24,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 13:39:24,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:24,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:39:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:39:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash -396669813, now seen corresponding path program 1 times [2022-07-14 13:39:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:39:24,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357694164] [2022-07-14 13:39:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:39:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 17 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:39:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:39:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357694164] [2022-07-14 13:39:24,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357694164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:39:24,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889150941] [2022-07-14 13:39:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:39:24,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:39:24,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:39:24,940 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) [2022-07-14 13:39:24,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 13:39:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:39:24,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 13:39:24,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:39:26,279 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int)) (let ((.cse0 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse1 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|))) (and (< 0 .cse0) (<= .cse1 (+ .cse0 1)) (< .cse0 (+ .cse1 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)))) is different from true [2022-07-14 13:39:27,789 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int)) (let ((.cse0 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse1 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|))) (and (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< 0 .cse0) (<= .cse1 (+ .cse0 1)) (< .cse0 (+ .cse1 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073)))) is different from true [2022-07-14 13:39:33,088 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int)) (let ((.cse3 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse2 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|))) (and (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (< .cse0 (+ 3 .cse1)) (<= .cse2 (+ .cse3 1)) (< .cse3 (+ .cse2 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< 0 .cse1) (<= .cse1 (+ .cse0 1))))) is different from true [2022-07-14 13:39:34,853 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int)) (let ((.cse3 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse2 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|))) (and (< .cse0 (+ 3 .cse1)) (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse2 (+ .cse3 1)) (< .cse3 (+ .cse2 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< 0 .cse1) (<= .cse1 (+ .cse0 1))))) is different from true [2022-07-14 13:39:46,875 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int)) (let ((.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse5 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse4 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse2 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|))) (and (< .cse0 (+ 3 .cse1)) (< .cse2 (+ .cse3 3)) (<= .cse3 (+ .cse2 1)) (<= .cse4 (+ .cse5 1)) (< .cse5 (+ .cse4 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (< 0 .cse2) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse1 (+ .cse0 1))))) is different from true [2022-07-14 13:39:49,053 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int)) (let ((.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse5 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse4 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse2 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|))) (and (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (< .cse0 (+ 3 .cse1)) (< .cse2 (+ .cse3 3)) (<= .cse3 (+ .cse2 1)) (<= .cse4 (+ .cse5 1)) (< .cse5 (+ .cse4 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (< 0 .cse2) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse1 (+ .cse0 1))))) is different from true [2022-07-14 13:40:15,351 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int)) (let ((.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse2 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse7 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse6 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse5 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (< .cse0 (+ 3 .cse1)) (< .cse2 (+ .cse3 3)) (<= .cse3 (+ .cse2 1)) (<= .cse4 (+ .cse5 1)) (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= .cse6 (+ .cse7 1)) (< .cse7 (+ .cse6 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (< 0 .cse4) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse1 (+ .cse0 1)) (< .cse5 (+ .cse4 3))))) is different from true [2022-07-14 13:40:17,619 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int)) (let ((.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse2 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse7 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse6 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse5 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (< .cse0 (+ 3 .cse1)) (< .cse2 (+ .cse3 3)) (<= .cse3 (+ .cse2 1)) (<= .cse4 (+ .cse5 1)) (<= .cse6 (+ .cse7 1)) (< .cse7 (+ .cse6 3)) (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (< 0 .cse4) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse1 (+ .cse0 1)) (< .cse5 (+ .cse4 3))))) is different from true [2022-07-14 13:40:44,091 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| Int)) (let ((.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse2 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse7 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse6 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse5 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2)) (.cse8 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| 2)) (.cse9 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127|))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (< .cse0 (+ 3 .cse1)) (< .cse2 (+ .cse3 3)) (<= .cse3 (+ .cse2 1)) (<= .cse4 (+ .cse5 1)) (<= .cse6 (+ .cse7 1)) (< .cse7 (+ .cse6 3)) (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (< 0 .cse8) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse1 (+ .cse0 1)) (< .cse9 (+ 3 .cse8)) (< .cse5 (+ .cse4 3)) (<= .cse8 (+ .cse9 1))))) is different from true [2022-07-14 13:40:46,485 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| Int)) (let ((.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse2 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse7 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse6 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse0 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse5 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2)) (.cse8 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| 2)) (.cse9 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127|))) (and (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (< .cse0 (+ 3 .cse1)) (< .cse2 (+ .cse3 3)) (<= .cse3 (+ .cse2 1)) (<= .cse4 (+ .cse5 1)) (<= .cse6 (+ .cse7 1)) (< .cse7 (+ .cse6 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (< 0 .cse8) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse1 (+ .cse0 1)) (< .cse9 (+ 3 .cse8)) (< .cse5 (+ .cse4 3)) (<= .cse8 (+ .cse9 1))))) is different from true [2022-07-14 13:41:06,948 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| Int)) (let ((.cse5 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse9 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse8 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| 3)) (.cse0 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| 2)) (.cse3 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse2 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse7 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse6 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2)) (.cse11 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| 2)) (.cse10 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127|))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (<= .cse0 (+ .cse1 1)) (< .cse2 (+ 3 .cse3)) (< .cse4 (+ .cse5 3)) (<= .cse5 (+ .cse4 1)) (<= .cse6 (+ .cse7 1)) (<= .cse8 (+ .cse9 1)) (< .cse9 (+ .cse8 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< .cse1 (+ .cse0 3)) (< 0 .cse0) (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse3 (+ .cse2 1)) (< .cse10 (+ 3 .cse11)) (< .cse7 (+ .cse6 3)) (<= .cse11 (+ .cse10 1))))) is different from true [2022-07-14 13:41:09,546 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| Int)) (let ((.cse5 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse9 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse8 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse1 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| 3)) (.cse0 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| 2)) (.cse3 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse2 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse7 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse6 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2)) (.cse11 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| 2)) (.cse10 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127|))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (<= .cse0 (+ .cse1 1)) (< .cse2 (+ 3 .cse3)) (< .cse4 (+ .cse5 3)) (<= .cse5 (+ .cse4 1)) (<= .cse6 (+ .cse7 1)) (<= .cse8 (+ .cse9 1)) (< .cse9 (+ .cse8 3)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< .cse1 (+ .cse0 3)) (< 0 .cse0) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse3 (+ .cse2 1)) (< .cse10 (+ 3 .cse11)) (< .cse7 (+ .cse6 3)) (<= .cse11 (+ .cse10 1))))) is different from true [2022-07-14 13:41:25,179 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_57_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_57_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| Int)) (let ((.cse5 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse11 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse10 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse7 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_57_61_119| 2)) (.cse1 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| 3)) (.cse0 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| 2)) (.cse6 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_57_61| 3)) (.cse3 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse2 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse9 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse8 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2)) (.cse13 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| 2)) (.cse12 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127|))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (<= .cse0 (+ .cse1 1)) (< .cse2 (+ 3 .cse3)) (< .cse4 (+ .cse5 3)) (< .cse6 (+ .cse7 3)) (<= .cse5 (+ .cse4 1)) (<= .cse8 (+ .cse9 1)) (<= .cse10 (+ .cse11 1)) (< .cse11 (+ .cse10 3)) (<= .cse7 (+ .cse6 1)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_57_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< .cse1 (+ .cse0 3)) (< 0 .cse6) (<= |c_ULTIMATE.start_main_~y~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_57_61_119|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse3 (+ .cse2 1)) (< .cse12 (+ 3 .cse13)) (< .cse9 (+ .cse8 3)) (<= .cse13 (+ .cse12 1))))) is different from true [2022-07-14 13:41:27,819 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_57_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_57_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| Int) (|aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| Int)) (let ((.cse5 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119| 2)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| 3)) (.cse11 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 3)) (.cse10 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|)) (.cse7 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_57_61_119| 2)) (.cse1 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| 3)) (.cse0 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41| 2)) (.cse6 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_57_61| 3)) (.cse3 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41| 2)) (.cse2 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127|)) (.cse9 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127|)) (.cse8 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41| 2)) (.cse13 (* |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41| 2)) (.cse12 (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127|))) (and (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_51_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_49_61_119|) (<= .cse0 (+ .cse1 1)) (< .cse2 (+ 3 .cse3)) (< .cse4 (+ .cse5 3)) (< .cse6 (+ .cse7 3)) (<= .cse5 (+ .cse4 1)) (<= .cse8 (+ .cse9 1)) (<= .cse10 (+ .cse11 1)) (< .cse11 (+ .cse10 3)) (<= .cse7 (+ .cse6 1)) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_57_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_55_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_45_61| 170073) (<= (div (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1|) 1) (- 3)) |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_57_61_119|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_53_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_51_41|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_47_41_127| |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_45_61_119|) (< .cse1 (+ .cse0 3)) (< 0 .cse6) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~y~0#1_55_41_127| |aux_div_v_ULTIMATE.start_main_~y~0#1_53_41|) (<= |aux_div_v_ULTIMATE.start_main_~y~0#1_49_61| |aux_div_v_ULTIMATE.start_main_~y~0#1_47_41|) (<= .cse3 (+ .cse2 1)) (< .cse12 (+ 3 .cse13)) (< .cse9 (+ .cse8 3)) (<= .cse13 (+ .cse12 1))))) is different from true [2022-07-14 13:41:38,956 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-14 13:41:38,957 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 13:41:38,963 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 101 [2022-07-14 13:41:38,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 13:41:39,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:41:39,158 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:929) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 45 more [2022-07-14 13:41:39,160 INFO L158 Benchmark]: Toolchain (without parser) took 138074.96ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 83.3MB in the beginning and 77.5MB in the end (delta: 5.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2022-07-14 13:41:39,160 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:41:39,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.76ms. Allocated memory is still 113.2MB. Free memory was 83.0MB in the beginning and 88.5MB in the end (delta: -5.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-14 13:41:39,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.81ms. Allocated memory is still 113.2MB. Free memory was 88.5MB in the beginning and 87.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:41:39,161 INFO L158 Benchmark]: Boogie Preprocessor took 10.93ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 86.4MB in the end (delta: 866.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:41:39,161 INFO L158 Benchmark]: RCFGBuilder took 174.09ms. Allocated memory is still 113.2MB. Free memory was 86.4MB in the beginning and 77.1MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:41:39,161 INFO L158 Benchmark]: TraceAbstraction took 137684.97ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 76.7MB in the beginning and 77.5MB in the end (delta: -803.3kB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-07-14 13:41:39,162 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.14ms. Allocated memory is still 81.8MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.76ms. Allocated memory is still 113.2MB. Free memory was 83.0MB in the beginning and 88.5MB in the end (delta: -5.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.81ms. Allocated memory is still 113.2MB. Free memory was 88.5MB in the beginning and 87.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.93ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 86.4MB in the end (delta: 866.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 174.09ms. Allocated memory is still 113.2MB. Free memory was 86.4MB in the beginning and 77.1MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 137684.97ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 76.7MB in the beginning and 77.5MB in the end (delta: -803.3kB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")