/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/loopv2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:15:19,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:15:19,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:15:19,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:15:19,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:15:19,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:15:19,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:15:19,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:15:19,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:15:19,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:15:19,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:15:19,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:15:19,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:15:19,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:15:19,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:15:19,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:15:19,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:15:19,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:15:19,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:15:19,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:15:19,531 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:15:19,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:15:19,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:15:19,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:15:19,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:15:19,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:15:19,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:15:19,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:15:19,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:15:19,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:15:19,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:15:19,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:15:19,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:15:19,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:15:19,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:15:19,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:15:19,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:15:19,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:15:19,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:15:19,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:15:19,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:15:19,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:15:19,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:15:19,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:15:19,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:15:19,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:15:19,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:15:19,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:15:19,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:15:19,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:15:19,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:15:19,566 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:15:19,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:15:19,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:15:19,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:15:19,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:15:19,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:15:19,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:15:19,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:15:19,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:15:19,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:15:19,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:15:19,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:15:19,569 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:15:19,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:15:19,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:15:19,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:15:19,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:15:19,725 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:15:19,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv2.c [2022-04-27 11:15:19,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42601a9c0/9b61df1f3c02483b8b443a5fdfc4ca2e/FLAG72d1c6b9c [2022-04-27 11:15:20,126 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:15:20,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv2.c [2022-04-27 11:15:20,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42601a9c0/9b61df1f3c02483b8b443a5fdfc4ca2e/FLAG72d1c6b9c [2022-04-27 11:15:20,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42601a9c0/9b61df1f3c02483b8b443a5fdfc4ca2e [2022-04-27 11:15:20,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:15:20,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:15:20,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:15:20,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:15:20,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:15:20,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f1c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20, skipping insertion in model container [2022-04-27 11:15:20,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:15:20,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:15:20,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv2.c[454,467] [2022-04-27 11:15:20,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:15:20,306 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:15:20,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv2.c[454,467] [2022-04-27 11:15:20,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:15:20,330 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:15:20,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20 WrapperNode [2022-04-27 11:15:20,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:15:20,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:15:20,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:15:20,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:15:20,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:15:20,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:15:20,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:15:20,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:15:20,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (1/1) ... [2022-04-27 11:15:20,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:15:20,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:20,383 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-04-27 11:15:20,390 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-04-27 11:15:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:15:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:15:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:15:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:15:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:15:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:15:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:15:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:15:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:15:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:15:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:15:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:15:20,458 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:15:20,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:15:20,607 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:15:20,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:15:20,612 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:15:20,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:15:20 BoogieIcfgContainer [2022-04-27 11:15:20,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:15:20,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:15:20,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:15:20,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:15:20,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:15:20" (1/3) ... [2022-04-27 11:15:20,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbb6014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:15:20, skipping insertion in model container [2022-04-27 11:15:20,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:20" (2/3) ... [2022-04-27 11:15:20,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbb6014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:15:20, skipping insertion in model container [2022-04-27 11:15:20,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:15:20" (3/3) ... [2022-04-27 11:15:20,632 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv2.c [2022-04-27 11:15:20,641 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:15:20,641 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:15:20,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:15:20,725 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51e566da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@372e3b31 [2022-04-27 11:15:20,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:15:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:15:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:15:20,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:20,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:20,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1146993295, now seen corresponding path program 1 times [2022-04-27 11:15:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:20,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721100488] [2022-04-27 11:15:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:20,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {25#true} is VALID [2022-04-27 11:15:20,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:15:20,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #62#return; {25#true} is VALID [2022-04-27 11:15:20,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:20,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {25#true} is VALID [2022-04-27 11:15:20,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:15:20,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #62#return; {25#true} is VALID [2022-04-27 11:15:20,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-27 11:15:20,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-27 11:15:20,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {30#(= main_~j~0 0)} is VALID [2022-04-27 11:15:20,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= main_~j~0 0)} assume !(~i~0 < ~n~0); {30#(= main_~j~0 0)} is VALID [2022-04-27 11:15:20,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= main_~j~0 0)} ~k~0 := ~i~0; {30#(= main_~j~0 0)} is VALID [2022-04-27 11:15:20,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= main_~j~0 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {26#false} is VALID [2022-04-27 11:15:20,999 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {26#false} is VALID [2022-04-27 11:15:20,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 11:15:20,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 11:15:21,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 11:15:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721100488] [2022-04-27 11:15:21,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721100488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:21,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:21,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:15:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978521964] [2022-04-27 11:15:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:15:21,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:21,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:15:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:15:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:15:21,056 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:21,196 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-27 11:15:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:15:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:15:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-27 11:15:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-27 11:15:21,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-27 11:15:21,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:21,271 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:15:21,271 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 11:15:21,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:15:21,278 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:21,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 11:15:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 11:15:21,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:21,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,302 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,302 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:21,304 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 11:15:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 11:15:21,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:21,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:21,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:15:21,305 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:15:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:21,306 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 11:15:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 11:15:21,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:21,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:21,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:21,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 11:15:21,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-27 11:15:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:21,309 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 11:15:21,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 11:15:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:15:21,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:21,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:21,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:15:21,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1162558691, now seen corresponding path program 1 times [2022-04-27 11:15:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361996146] [2022-04-27 11:15:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {152#true} is VALID [2022-04-27 11:15:21,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:15:21,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #62#return; {152#true} is VALID [2022-04-27 11:15:21,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:21,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {152#true} is VALID [2022-04-27 11:15:21,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:15:21,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #62#return; {152#true} is VALID [2022-04-27 11:15:21,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret5 := main(); {152#true} is VALID [2022-04-27 11:15:21,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {152#true} is VALID [2022-04-27 11:15:21,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {157#(= main_~j~0 0)} is VALID [2022-04-27 11:15:21,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(= main_~j~0 0)} assume !(~i~0 < ~n~0); {157#(= main_~j~0 0)} is VALID [2022-04-27 11:15:21,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#(= main_~j~0 0)} ~k~0 := ~i~0; {157#(= main_~j~0 0)} is VALID [2022-04-27 11:15:21,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#(= main_~j~0 0)} assume !!(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2));~j~0 := ~j~0 - 4;~k~0 := ~k~0 - 4; {158#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 0 (+ main_~j~0 4)))} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {158#(and (<= main_~j~0 (* 2 (div main_~j~0 2))) (<= 0 (+ main_~j~0 4)))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {153#false} is VALID [2022-04-27 11:15:21,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {153#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {153#false} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2022-04-27 11:15:21,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-27 11:15:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:21,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361996146] [2022-04-27 11:15:21,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361996146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:21,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707799593] [2022-04-27 11:15:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:21,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:21,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:21,500 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-04-27 11:15:21,501 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-04-27 11:15:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:15:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:21,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2022-04-27 11:15:21,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {152#true} is VALID [2022-04-27 11:15:21,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:15:21,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #62#return; {152#true} is VALID [2022-04-27 11:15:21,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret5 := main(); {152#true} is VALID [2022-04-27 11:15:21,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {152#true} is VALID [2022-04-27 11:15:21,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {157#(= main_~j~0 0)} is VALID [2022-04-27 11:15:21,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(= main_~j~0 0)} assume !(~i~0 < ~n~0); {157#(= main_~j~0 0)} is VALID [2022-04-27 11:15:21,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#(= main_~j~0 0)} ~k~0 := ~i~0; {157#(= main_~j~0 0)} is VALID [2022-04-27 11:15:21,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#(= main_~j~0 0)} assume !!(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2));~j~0 := ~j~0 - 4;~k~0 := ~k~0 - 4; {190#(= main_~j~0 (- 4))} is VALID [2022-04-27 11:15:21,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= main_~j~0 (- 4))} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {153#false} is VALID [2022-04-27 11:15:21,600 INFO L272 TraceCheckUtils]: 11: Hoare triple {153#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {153#false} is VALID [2022-04-27 11:15:21,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2022-04-27 11:15:21,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2022-04-27 11:15:21,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-27 11:15:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:21,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:21,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-27 11:15:21,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2022-04-27 11:15:21,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2022-04-27 11:15:21,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {153#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {153#false} is VALID [2022-04-27 11:15:21,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#(= (mod main_~j~0 2) 0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {153#false} is VALID [2022-04-27 11:15:21,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#(= (mod main_~j~0 2) 0)} assume !!(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2));~j~0 := ~j~0 - 4;~k~0 := ~k~0 - 4; {218#(= (mod main_~j~0 2) 0)} is VALID [2022-04-27 11:15:21,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(= (mod main_~j~0 2) 0)} ~k~0 := ~i~0; {218#(= (mod main_~j~0 2) 0)} is VALID [2022-04-27 11:15:21,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(= (mod main_~j~0 2) 0)} assume !(~i~0 < ~n~0); {218#(= (mod main_~j~0 2) 0)} is VALID [2022-04-27 11:15:21,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {218#(= (mod main_~j~0 2) 0)} is VALID [2022-04-27 11:15:21,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {152#true} is VALID [2022-04-27 11:15:21,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret5 := main(); {152#true} is VALID [2022-04-27 11:15:21,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #62#return; {152#true} is VALID [2022-04-27 11:15:21,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:15:21,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {152#true} is VALID [2022-04-27 11:15:21,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2022-04-27 11:15:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:15:21,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707799593] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:21,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:15:21,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2022-04-27 11:15:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342263492] [2022-04-27 11:15:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:15:21,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:21,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:21,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:15:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:15:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:15:21,664 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:21,683 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:15:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:15:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:15:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 11:15:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 11:15:21,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-27 11:15:21,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:21,704 INFO L225 Difference]: With dead ends: 24 [2022-04-27 11:15:21,704 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:15:21,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:15:21,705 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:21,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:15:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 11:15:21,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:21,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,708 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,708 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:21,709 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 11:15:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 11:15:21,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:21,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:21,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:15:21,709 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:15:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:21,710 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 11:15:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 11:15:21,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:21,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:21,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:21,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 11:15:21,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2022-04-27 11:15:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:21,712 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 11:15:21,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 11:15:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:15:21,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:21,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:21,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:21,925 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-04-27 11:15:21,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:21,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1035344830, now seen corresponding path program 1 times [2022-04-27 11:15:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:21,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346984] [2022-04-27 11:15:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:22,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {345#true} is VALID [2022-04-27 11:15:22,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-27 11:15:22,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #62#return; {345#true} is VALID [2022-04-27 11:15:22,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:22,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {345#true} is VALID [2022-04-27 11:15:22,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-27 11:15:22,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #62#return; {345#true} is VALID [2022-04-27 11:15:22,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret5 := main(); {345#true} is VALID [2022-04-27 11:15:22,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#true} is VALID [2022-04-27 11:15:22,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {350#(= main_~i~0 0)} is VALID [2022-04-27 11:15:22,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-27 11:15:22,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-27 11:15:22,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-27 11:15:22,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {346#false} is VALID [2022-04-27 11:15:22,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {346#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {346#false} is VALID [2022-04-27 11:15:22,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#false} ~cond := #in~cond; {346#false} is VALID [2022-04-27 11:15:22,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#false} assume 0 == ~cond; {346#false} is VALID [2022-04-27 11:15:22,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-27 11:15:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461346984] [2022-04-27 11:15:22,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461346984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439968871] [2022-04-27 11:15:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:22,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:22,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:22,030 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-04-27 11:15:22,031 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-04-27 11:15:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:22,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:15:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:22,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:22,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2022-04-27 11:15:22,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {345#true} is VALID [2022-04-27 11:15:22,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-27 11:15:22,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #62#return; {345#true} is VALID [2022-04-27 11:15:22,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret5 := main(); {345#true} is VALID [2022-04-27 11:15:22,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#true} is VALID [2022-04-27 11:15:22,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {350#(= main_~i~0 0)} is VALID [2022-04-27 11:15:22,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {377#(= (+ (- 2) main_~j~0) 4)} is VALID [2022-04-27 11:15:22,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(= (+ (- 2) main_~j~0) 4)} assume !(~i~0 < ~n~0); {377#(= (+ (- 2) main_~j~0) 4)} is VALID [2022-04-27 11:15:22,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(= (+ (- 2) main_~j~0) 4)} ~k~0 := ~i~0; {377#(= (+ (- 2) main_~j~0) 4)} is VALID [2022-04-27 11:15:22,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {377#(= (+ (- 2) main_~j~0) 4)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {346#false} is VALID [2022-04-27 11:15:22,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {346#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {346#false} is VALID [2022-04-27 11:15:22,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#false} ~cond := #in~cond; {346#false} is VALID [2022-04-27 11:15:22,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#false} assume 0 == ~cond; {346#false} is VALID [2022-04-27 11:15:22,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-27 11:15:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:22,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:22,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-27 11:15:22,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#false} assume 0 == ~cond; {346#false} is VALID [2022-04-27 11:15:22,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#false} ~cond := #in~cond; {346#false} is VALID [2022-04-27 11:15:22,193 INFO L272 TraceCheckUtils]: 11: Hoare triple {346#false} call __VERIFIER_assert((if 0 == (if ~k~0 < 0 && 0 != ~k~0 % 2 then ~k~0 % 2 - 2 else ~k~0 % 2) then 1 else 0)); {346#false} is VALID [2022-04-27 11:15:22,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(0 == (if ~j~0 < 0 && 0 != ~j~0 % 2 then ~j~0 % 2 - 2 else ~j~0 % 2)); {346#false} is VALID [2022-04-27 11:15:22,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} ~k~0 := ~i~0; {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-27 11:15:22,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} assume !(~i~0 < ~n~0); {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-27 11:15:22,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} assume !!(~i~0 < ~n~0);~i~0 := 4 + ~i~0;~j~0 := 2 + ~i~0; {351#(= (* 2 (div main_~j~0 2)) main_~j~0)} is VALID [2022-04-27 11:15:22,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {420#(= (+ main_~i~0 6) (* (div (+ main_~i~0 6) 2) 2))} is VALID [2022-04-27 11:15:22,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#true} is VALID [2022-04-27 11:15:22,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret5 := main(); {345#true} is VALID [2022-04-27 11:15:22,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #62#return; {345#true} is VALID [2022-04-27 11:15:22,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-27 11:15:22,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {345#true} is VALID [2022-04-27 11:15:22,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2022-04-27 11:15:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:22,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439968871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:22,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:22,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-27 11:15:22,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818138675] [2022-04-27 11:15:22,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:15:22,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:22,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:22,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:15:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:15:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:15:22,216 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:22,305 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-27 11:15:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:15:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:15:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 11:15:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 11:15:22,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-27 11:15:22,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:22,331 INFO L225 Difference]: With dead ends: 19 [2022-04-27 11:15:22,331 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:15:22,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:15:22,334 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:22,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:15:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:15:22,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:22,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:15:22,337 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:15:22,337 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:15:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:22,337 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:15:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:15:22,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:22,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:22,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:15:22,342 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:15:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:22,342 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:15:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:15:22,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:22,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:22,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:22,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:15:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:15:22,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-27 11:15:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:22,343 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:15:22,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:15:22,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:22,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:15:22,365 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-04-27 11:15:22,552 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-04-27 11:15:22,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:15:22,605 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:15:22,606 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 34) no Hoare annotation was computed. [2022-04-27 11:15:22,606 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 34) no Hoare annotation was computed. [2022-04-27 11:15:22,606 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 11:15:22,606 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 34) the Hoare annotation is: true [2022-04-27 11:15:22,606 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (= (mod main_~j~0 2) 0) [2022-04-27 11:15:22,606 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 31) the Hoare annotation is: false [2022-04-27 11:15:22,606 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-27 11:15:22,606 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (let ((.cse0 (+ main_~i~0 6))) (= .cse0 (* (div .cse0 2) 2))) (= (* 2 (div main_~j~0 2)) main_~j~0)) [2022-04-27 11:15:22,606 INFO L899 garLoopResultBuilder]: For program point L22-3(lines 22 26) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:15:22,607 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 15) the Hoare annotation is: true [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2022-04-27 11:15:22,607 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 15) no Hoare annotation was computed. [2022-04-27 11:15:22,608 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 15) no Hoare annotation was computed. [2022-04-27 11:15:22,608 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 11:15:22,610 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 11:15:22,611 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:15:22,617 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:15:22,617 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:15:22,627 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 11:15:22,628 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:15:22,629 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 11:15:22,629 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 11:15:22,630 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:15:22,630 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:15:22,630 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 11:15:22,630 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:15:22,630 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 11:15:22,630 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:15:22,632 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 11:15:22,632 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 11:15:22,632 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:15:22,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:15:22 BoogieIcfgContainer [2022-04-27 11:15:22,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:15:22,639 INFO L158 Benchmark]: Toolchain (without parser) took 2498.42ms. Allocated memory was 206.6MB in the beginning and 287.3MB in the end (delta: 80.7MB). Free memory was 151.6MB in the beginning and 121.7MB in the end (delta: 29.9MB). Peak memory consumption was 110.4MB. Max. memory is 8.0GB. [2022-04-27 11:15:22,639 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 206.6MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:15:22,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.29ms. Allocated memory was 206.6MB in the beginning and 287.3MB in the end (delta: 80.7MB). Free memory was 151.4MB in the beginning and 259.6MB in the end (delta: -108.3MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-27 11:15:22,639 INFO L158 Benchmark]: Boogie Preprocessor took 28.38ms. Allocated memory is still 287.3MB. Free memory was 259.6MB in the beginning and 258.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:15:22,640 INFO L158 Benchmark]: RCFGBuilder took 252.81ms. Allocated memory is still 287.3MB. Free memory was 258.1MB in the beginning and 245.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:15:22,640 INFO L158 Benchmark]: TraceAbstraction took 2023.30ms. Allocated memory is still 287.3MB. Free memory was 245.0MB in the beginning and 121.7MB in the end (delta: 123.2MB). Peak memory consumption was 123.7MB. Max. memory is 8.0GB. [2022-04-27 11:15:22,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 206.6MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.29ms. Allocated memory was 206.6MB in the beginning and 287.3MB in the end (delta: 80.7MB). Free memory was 151.4MB in the beginning and 259.6MB in the end (delta: -108.3MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.38ms. Allocated memory is still 287.3MB. Free memory was 259.6MB in the beginning and 258.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 252.81ms. Allocated memory is still 287.3MB. Free memory was 258.1MB in the beginning and 245.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2023.30ms. Allocated memory is still 287.3MB. Free memory was 245.0MB in the beginning and 121.7MB in the end (delta: 123.2MB). Peak memory consumption was 123.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 41 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 39 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 83 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 3 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 1/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: j % 2 == 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: i + 6 == (i + 6) / 2 * 2 && 2 * (j / 2) == j RESULT: Ultimate proved your program to be correct! [2022-04-27 11:15:22,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...