/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/loop-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:53:22,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:53:22,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:53:22,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:53:22,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:53:22,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:53:22,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:53:22,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:53:22,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:53:22,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:53:22,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:53:22,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:53:22,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:53:22,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:53:22,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:53:22,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:53:22,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:53:22,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:53:22,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:53:22,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:53:22,798 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:53:22,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:53:22,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:53:22,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:53:22,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:53:22,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:53:22,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:53:22,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:53:22,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:53:22,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:53:22,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:53:22,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:53:22,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:53:22,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:53:22,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:53:22,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:53:22,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:53:22,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:53:22,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:53:22,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:53:22,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:53:22,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:53:22,826 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 10:53:22,851 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:53:22,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:53:22,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:53:22,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:53:22,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:53:22,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:53:22,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:53:22,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:53:22,852 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:53:22,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:53:22,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:53:22,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:22,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:53:22,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:53:22,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:53:22,855 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 10:53:23,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:53:23,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:53:23,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:53:23,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:53:23,059 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:53:23,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-27 10:53:23,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56591a37d/473967e6ecd64733a8222aca87976340/FLAG58c65ed49 [2022-04-27 10:53:23,458 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:53:23,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-27 10:53:23,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56591a37d/473967e6ecd64733a8222aca87976340/FLAG58c65ed49 [2022-04-27 10:53:23,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56591a37d/473967e6ecd64733a8222aca87976340 [2022-04-27 10:53:23,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:53:23,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:53:23,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:23,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:53:23,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:53:23,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:23" (1/1) ... [2022-04-27 10:53:23,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2770c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:23, skipping insertion in model container [2022-04-27 10:53:23,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:53:23" (1/1) ... [2022-04-27 10:53:23,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:53:23,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:53:24,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908] [2022-04-27 10:53:24,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:24,088 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:53:24,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908] [2022-04-27 10:53:24,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:53:24,111 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:53:24,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24 WrapperNode [2022-04-27 10:53:24,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:53:24,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:53:24,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:53:24,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:53:24,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:53:24,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:53:24,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:53:24,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:53:24,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (1/1) ... [2022-04-27 10:53:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:53:24,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:24,166 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 10:53:24,172 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 10:53:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:53:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:53:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:53:24,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:53:24,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:53:24,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:53:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:53:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:53:24,242 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:53:24,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:53:24,354 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:53:24,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:53:24,359 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:53:24,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:24 BoogieIcfgContainer [2022-04-27 10:53:24,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:53:24,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:53:24,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:53:24,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:53:24,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:53:23" (1/3) ... [2022-04-27 10:53:24,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401c064d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:24, skipping insertion in model container [2022-04-27 10:53:24,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:53:24" (2/3) ... [2022-04-27 10:53:24,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401c064d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:53:24, skipping insertion in model container [2022-04-27 10:53:24,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:53:24" (3/3) ... [2022-04-27 10:53:24,367 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2022-04-27 10:53:24,376 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:53:24,376 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:53:24,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:53:24,426 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@705c01b5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b6ac9ce [2022-04-27 10:53:24,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:53:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 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 10:53:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:53:24,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:24,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:24,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 1 times [2022-04-27 10:53:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:24,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065067399] [2022-04-27 10:53:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:24,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#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); {25#true} is VALID [2022-04-27 10:53:24,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:53:24,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-27 10:53:24,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:24,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#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); {25#true} is VALID [2022-04-27 10:53:24,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:53:24,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-27 10:53:24,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-27 10:53:24,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {25#true} is VALID [2022-04-27 10:53:24,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {25#true} is VALID [2022-04-27 10:53:24,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {25#true} is VALID [2022-04-27 10:53:24,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 10:53:24,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~i~0 == ~j~0; {26#false} is VALID [2022-04-27 10:53:24,569 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {26#false} is VALID [2022-04-27 10:53:24,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 10:53:24,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 10:53:24,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 10:53:24,570 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 10:53:24,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:24,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065067399] [2022-04-27 10:53:24,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065067399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:24,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:24,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:53:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437120651] [2022-04-27 10:53:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:24,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,618 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 10:53:24,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:53:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:53:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:53:24,634 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:24,700 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 10:53:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:53:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 10:53:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 10:53:24,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-27 10:53:24,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:24,780 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:53:24,780 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:53:24,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:53:24,788 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:24,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:53:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:53:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:53:24,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:24,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 10:53:24,815 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 10:53:24,816 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 10:53:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:24,820 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:53:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:24,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:24,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:24,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-27 10:53:24,821 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-27 10:53:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:24,824 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:53:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:24,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:24,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:24,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:24,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 10:53:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:53:24,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-04-27 10:53:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:24,833 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:53:24,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 10:53:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:53:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:53:24,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:24,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:24,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:53:24,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:24,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 1 times [2022-04-27 10:53:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:24,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337127877] [2022-04-27 10:53:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#(and (= |#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); {129#true} is VALID [2022-04-27 10:53:25,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:53:25,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #64#return; {129#true} is VALID [2022-04-27 10:53:25,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:25,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#(and (= |#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); {129#true} is VALID [2022-04-27 10:53:25,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:53:25,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} #64#return; {129#true} is VALID [2022-04-27 10:53:25,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} call #t~ret5 := main(); {129#true} is VALID [2022-04-27 10:53:25,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {129#true} is VALID [2022-04-27 10:53:25,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {129#true} is VALID [2022-04-27 10:53:25,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {129#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {134#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID [2022-04-27 10:53:25,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} assume !(0 != ~x~0); {135#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-27 10:53:25,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} assume ~i~0 == ~j~0; {136#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-27 10:53:25,138 INFO L272 TraceCheckUtils]: 10: Hoare triple {136#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:25,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {138#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:25,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {138#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {130#false} is VALID [2022-04-27 10:53:25,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-04-27 10:53:25,139 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 10:53:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:25,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337127877] [2022-04-27 10:53:25,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337127877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:25,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:53:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034686781] [2022-04-27 10:53:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:25,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,154 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 10:53:25,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:53:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:53:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:53:25,156 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:25,362 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:53:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:53:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-27 10:53:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-27 10:53:25,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-27 10:53:25,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:25,380 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:53:25,381 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:53:25,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:53:25,382 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:25,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:53:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:53:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 10:53:25,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:25,386 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 10:53:25,386 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 10:53:25,387 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 10:53:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:25,387 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:53:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:53:25,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:25,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:25,388 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 10:53:25,388 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 10:53:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:25,389 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:53:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:53:25,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:25,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:25,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:25,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:25,389 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 10:53:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:53:25,390 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-27 10:53:25,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:25,390 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:53:25,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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 10:53:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:53:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:53:25,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:25,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:25,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:53:25,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 1 times [2022-04-27 10:53:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:25,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838394459] [2022-04-27 10:53:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#(and (= |#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); {240#true} is VALID [2022-04-27 10:53:25,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 10:53:25,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #64#return; {240#true} is VALID [2022-04-27 10:53:25,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:25,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#(and (= |#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); {240#true} is VALID [2022-04-27 10:53:25,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 10:53:25,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #64#return; {240#true} is VALID [2022-04-27 10:53:25,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret5 := main(); {240#true} is VALID [2022-04-27 10:53:25,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {240#true} is VALID [2022-04-27 10:53:25,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {240#true} is VALID [2022-04-27 10:53:25,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:25,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {246#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-27 10:53:25,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {247#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 10:53:25,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-27 10:53:25,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {249#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:25,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {250#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:25,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {250#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {241#false} is VALID [2022-04-27 10:53:25,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-04-27 10:53:25,569 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 10:53:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:25,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838394459] [2022-04-27 10:53:25,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838394459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:25,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729617571] [2022-04-27 10:53:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:25,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:25,573 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 10:53:25,582 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 10:53:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 10:53:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:25,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:25,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2022-04-27 10:53:25,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#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); {240#true} is VALID [2022-04-27 10:53:25,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 10:53:25,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #64#return; {240#true} is VALID [2022-04-27 10:53:25,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret5 := main(); {240#true} is VALID [2022-04-27 10:53:25,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {240#true} is VALID [2022-04-27 10:53:25,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {240#true} is VALID [2022-04-27 10:53:25,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:25,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {279#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-27 10:53:25,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {279#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume !(0 != ~x~0); {283#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-27 10:53:25,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume ~i~0 == ~j~0; {287#(and (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 10:53:25,965 INFO L272 TraceCheckUtils]: 11: Hoare triple {287#(and (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:25,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:25,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {241#false} is VALID [2022-04-27 10:53:25,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-04-27 10:53:25,966 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 10:53:25,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:26,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-04-27 10:53:26,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {241#false} is VALID [2022-04-27 10:53:26,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:26,145 INFO L272 TraceCheckUtils]: 11: Hoare triple {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:26,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-27 10:53:26,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {314#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-27 10:53:26,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {318#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 10:53:26,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {322#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-27 10:53:26,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {240#true} is VALID [2022-04-27 10:53:26,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {240#true} is VALID [2022-04-27 10:53:26,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret5 := main(); {240#true} is VALID [2022-04-27 10:53:26,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #64#return; {240#true} is VALID [2022-04-27 10:53:26,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 10:53:26,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#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); {240#true} is VALID [2022-04-27 10:53:26,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2022-04-27 10:53:26,148 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 10:53:26,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729617571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:26,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:26,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-27 10:53:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469194987] [2022-04-27 10:53:26,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:26,150 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 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 10:53:26,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:26,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:26,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:26,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 10:53:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 10:53:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:53:26,168 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:26,601 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:53:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:53:26,602 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 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 10:53:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-27 10:53:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-27 10:53:26,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2022-04-27 10:53:26,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:26,631 INFO L225 Difference]: With dead ends: 27 [2022-04-27 10:53:26,632 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 10:53:26,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-04-27 10:53:26,633 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:26,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 63 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 10:53:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 10:53:26,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:26,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 10:53:26,643 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 10:53:26,643 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 10:53:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:26,644 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:53:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:53:26,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:26,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:26,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 19 states. [2022-04-27 10:53:26,645 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 19 states. [2022-04-27 10:53:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:26,646 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:53:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:53:26,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:26,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:26,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:26,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 10:53:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-27 10:53:26,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2022-04-27 10:53:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:26,647 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-27 10:53:26,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:53:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:53:26,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:26,648 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:26,679 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 10:53:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:26,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2142975758, now seen corresponding path program 2 times [2022-04-27 10:53:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:26,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548774348] [2022-04-27 10:53:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:27,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:27,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {493#(and (= |#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); {480#true} is VALID [2022-04-27 10:53:27,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2022-04-27 10:53:27,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #64#return; {480#true} is VALID [2022-04-27 10:53:27,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:27,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(and (= |#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); {480#true} is VALID [2022-04-27 10:53:27,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2022-04-27 10:53:27,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #64#return; {480#true} is VALID [2022-04-27 10:53:27,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret5 := main(); {480#true} is VALID [2022-04-27 10:53:27,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {480#true} is VALID [2022-04-27 10:53:27,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {480#true} is VALID [2022-04-27 10:53:27,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:27,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {486#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} is VALID [2022-04-27 10:53:27,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {486#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} is VALID [2022-04-27 10:53:27,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} is VALID [2022-04-27 10:53:27,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {488#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-27 10:53:27,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {488#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {489#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 10:53:27,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-27 10:53:27,076 INFO L272 TraceCheckUtils]: 14: Hoare triple {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:53:27,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {492#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:53:27,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {481#false} is VALID [2022-04-27 10:53:27,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} assume !false; {481#false} is VALID [2022-04-27 10:53:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:53:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548774348] [2022-04-27 10:53:27,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548774348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:53:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188343783] [2022-04-27 10:53:27,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:53:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:53:27,080 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 10:53:27,081 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 10:53:27,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:53:27,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:53:27,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 10:53:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:27,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:53:27,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2022-04-27 10:53:27,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#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); {480#true} is VALID [2022-04-27 10:53:27,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2022-04-27 10:53:27,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #64#return; {480#true} is VALID [2022-04-27 10:53:27,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret5 := main(); {480#true} is VALID [2022-04-27 10:53:27,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {480#true} is VALID [2022-04-27 10:53:27,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {480#true} is VALID [2022-04-27 10:53:27,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 10:53:27,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {521#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-27 10:53:27,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {521#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {525#(and (= (+ (- 2) main_~z~0) 0) (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)))} is VALID [2022-04-27 10:53:27,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(and (= (+ (- 2) main_~z~0) 0) (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {529#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= 0 (+ main_~z~0 (- 3))) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} is VALID [2022-04-27 10:53:27,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= 0 (+ main_~z~0 (- 3))) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {533#(and (= (+ main_~x~0 3) (+ (- 1) main_~i~0)) (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (<= main_~j~0 (+ main_~y~0 8)))} is VALID [2022-04-27 10:53:27,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#(and (= (+ main_~x~0 3) (+ (- 1) main_~i~0)) (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (<= main_~j~0 (+ main_~y~0 8)))} assume !(0 != ~x~0); {537#(and (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (= (+ (- 1) main_~i~0) 3) (<= main_~j~0 (+ main_~y~0 8)))} is VALID [2022-04-27 10:53:27,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(and (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (= (+ (- 1) main_~i~0) 3) (<= main_~j~0 (+ main_~y~0 8)))} assume ~i~0 == ~j~0; {541#(and (<= (+ main_~y~0 4) 0) (<= 0 (+ main_~y~0 4)) (= main_~z~0 4))} is VALID [2022-04-27 10:53:27,454 INFO L272 TraceCheckUtils]: 14: Hoare triple {541#(and (<= (+ main_~y~0 4) 0) (<= 0 (+ main_~y~0 4)) (= main_~z~0 4))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:27,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:27,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {481#false} is VALID [2022-04-27 10:53:27,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} assume !false; {481#false} is VALID [2022-04-27 10:53:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:27,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:53:27,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} assume !false; {481#false} is VALID [2022-04-27 10:53:27,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {481#false} is VALID [2022-04-27 10:53:27,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:53:27,749 INFO L272 TraceCheckUtils]: 14: Hoare triple {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:53:27,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {568#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-27 10:53:27,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {572#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {568#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-27 10:53:27,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {572#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 10:53:27,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {576#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} is VALID [2022-04-27 10:53:27,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 1) main_~x~0) 2)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {580#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} is VALID [2022-04-27 10:53:27,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {588#(or (not (= main_~i~0 main_~j~0)) (and (< 3 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 4)) (not (= main_~x~0 4)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {584#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 1) main_~x~0) 2)))} is VALID [2022-04-27 10:53:27,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {588#(or (not (= main_~i~0 main_~j~0)) (and (< 3 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 4)) (not (= main_~x~0 4)))} is VALID [2022-04-27 10:53:27,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {480#true} is VALID [2022-04-27 10:53:27,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {480#true} is VALID [2022-04-27 10:53:27,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret5 := main(); {480#true} is VALID [2022-04-27 10:53:27,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #64#return; {480#true} is VALID [2022-04-27 10:53:27,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2022-04-27 10:53:27,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#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); {480#true} is VALID [2022-04-27 10:53:27,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2022-04-27 10:53:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:53:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188343783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:53:27,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:53:27,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-04-27 10:53:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635820945] [2022-04-27 10:53:27,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:53:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:53:27,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:27,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:27,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:27,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 10:53:27,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 10:53:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-27 10:53:27,782 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:28,213 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:53:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:53:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:53:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2022-04-27 10:53:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2022-04-27 10:53:28,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 23 transitions. [2022-04-27 10:53:28,235 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 10:53:28,235 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:53:28,235 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:53:28,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 10:53:28,237 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:28,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:53:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:53:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:53:28,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:28,237 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 10:53:28,238 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 10:53:28,238 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 10:53:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:28,238 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:28,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:28,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:28,238 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 10:53:28,238 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 10:53:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:28,238 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:28,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:28,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:28,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:28,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:28,239 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 10:53:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:53:28,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 10:53:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:28,239 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:53:28,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:28,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:28,241 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:53:28,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 10:53:28,442 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,SelfDestructingSolverStorable3 [2022-04-27 10:53:28,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:53:28,549 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 37) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~z~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point L33-3(lines 24 42) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 42) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 42) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-04-27 10:53:28,550 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 42) the Hoare annotation is: true [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~z~0 main_~y~0 1)))) (or (and (or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1))) (<= (+ main_~z~0 main_~y~0) 0) .cse0) (and (= main_~z~0 0) (<= main_~y~0 0) (= main_~i~0 0) .cse0))) [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:53:28,551 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:53:28,551 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:53:28,552 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:53:28,554 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 10:53:28,555 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:53:28,557 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:28,557 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:28,557 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:53:28,558 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 10:53:28,559 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 10:53:28,561 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:53:28,561 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 10:53:28,561 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 10:53:28,561 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:53:28,561 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:53:28,561 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:53:28,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:53:28 BoogieIcfgContainer [2022-04-27 10:53:28,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:53:28,567 INFO L158 Benchmark]: Toolchain (without parser) took 4655.57ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 143.4MB in the beginning and 91.7MB in the end (delta: 51.7MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-27 10:53:28,567 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:53:28,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.35ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 143.3MB in the beginning and 239.6MB in the end (delta: -96.3MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-04-27 10:53:28,567 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 270.5MB. Free memory was 239.6MB in the beginning and 238.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:53:28,568 INFO L158 Benchmark]: RCFGBuilder took 217.10ms. Allocated memory is still 270.5MB. Free memory was 238.0MB in the beginning and 226.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:53:28,568 INFO L158 Benchmark]: TraceAbstraction took 4204.96ms. Allocated memory is still 270.5MB. Free memory was 225.5MB in the beginning and 91.7MB in the end (delta: 133.7MB). Peak memory consumption was 134.3MB. Max. memory is 8.0GB. [2022-04-27 10:53:28,568 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.09ms. Allocated memory is still 203.4MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.35ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 143.3MB in the beginning and 239.6MB in the end (delta: -96.3MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 270.5MB. Free memory was 239.6MB in the beginning and 238.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 217.10ms. Allocated memory is still 270.5MB. Free memory was 238.0MB in the beginning and 226.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4204.96ms. Allocated memory is still 270.5MB. Free memory was 225.5MB in the beginning and 91.7MB in the end (delta: 133.7MB). Peak memory consumption was 134.3MB. 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: 19]: 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: 4.1s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 55 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 66 HoareAnnotationTreeSize, 12 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 318 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 840 SizeOfPredicates, 12 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/33 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: 33]: Loop Invariant Derived loop invariant: i + z + y <= j + x && j + x <= i + z + y RESULT: Ultimate proved your program to be correct! [2022-04-27 10:53:28,590 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...