/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-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:47:34,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:47:34,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:47:34,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:47:34,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:47:34,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:47:34,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:47:34,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:47:34,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:47:34,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:47:34,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:47:34,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:47:34,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:47:34,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:47:34,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:47:34,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:47:34,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:47:34,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:47:34,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:47:34,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:47:34,952 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:47:34,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:47:34,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:47:34,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:47:34,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:47:34,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:47:34,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:47:34,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:47:34,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:47:34,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:47:34,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:47:34,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:47:34,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:47:34,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:47:34,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:47:34,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:47:34,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:47:34,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:47:34,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:47:34,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:47:34,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:47:34,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:47:34,986 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:47:34,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:47:35,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:47:35,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:47:35,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:47:35,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:47:35,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:47:35,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:47:35,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:47:35,002 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:47:35,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:47:35,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:47:35,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:47:35,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:47:35,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:47:35,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:47:35,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:47:35,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:47:35,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:47:35,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:47:35,006 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:47:35,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:47:35,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:47:35,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:47:35,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:47:35,192 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:47:35,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-27 10:47:35,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee1153f4/00b8308eb6bc4a1d9e0caf1deaf5eadd/FLAGff1d79a1e [2022-04-27 10:47:35,548 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:47:35,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-27 10:47:35,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee1153f4/00b8308eb6bc4a1d9e0caf1deaf5eadd/FLAGff1d79a1e [2022-04-27 10:47:35,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee1153f4/00b8308eb6bc4a1d9e0caf1deaf5eadd [2022-04-27 10:47:35,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:47:35,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:47:35,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:47:35,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:47:35,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:47:35,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:47:35" (1/1) ... [2022-04-27 10:47:35,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3290a0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:35, skipping insertion in model container [2022-04-27 10:47:35,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:47:35" (1/1) ... [2022-04-27 10:47:35,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:47:35,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:47:36,131 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-invgen/large_const.i[893,906] [2022-04-27 10:47:36,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:47:36,170 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:47:36,187 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-invgen/large_const.i[893,906] [2022-04-27 10:47:36,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:47:36,210 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:47:36,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36 WrapperNode [2022-04-27 10:47:36,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:47:36,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:47:36,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:47:36,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:47:36,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:47:36,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:47:36,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:47:36,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:47:36,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (1/1) ... [2022-04-27 10:47:36,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:47:36,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:36,297 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:47:36,311 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:47:36,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:47:36,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:47:36,341 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:47:36,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:47:36,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:47:36,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:47:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:47:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:47:36,419 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:47:36,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:47:36,601 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:47:36,607 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:47:36,607 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:47:36,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:47:36 BoogieIcfgContainer [2022-04-27 10:47:36,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:47:36,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:47:36,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:47:36,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:47:36,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:47:35" (1/3) ... [2022-04-27 10:47:36,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e645580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:47:36, skipping insertion in model container [2022-04-27 10:47:36,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:47:36" (2/3) ... [2022-04-27 10:47:36,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e645580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:47:36, skipping insertion in model container [2022-04-27 10:47:36,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:47:36" (3/3) ... [2022-04-27 10:47:36,614 INFO L111 eAbstractionObserver]: Analyzing ICFG large_const.i [2022-04-27 10:47:36,625 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:47:36,625 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:47:36,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:47:36,679 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@6d23e6f6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a467f8c [2022-04-27 10:47:36,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:47:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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:47:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:47:36,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:36,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:36,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:36,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash -829760349, now seen corresponding path program 1 times [2022-04-27 10:47:36,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154470081] [2022-04-27 10:47:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:36,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(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); {29#true} is VALID [2022-04-27 10:47:36,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 10:47:36,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #83#return; {29#true} is VALID [2022-04-27 10:47:36,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:36,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(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); {29#true} is VALID [2022-04-27 10:47:36,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 10:47:36,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #83#return; {29#true} is VALID [2022-04-27 10:47:36,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {29#true} is VALID [2022-04-27 10:47:36,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29#true} is VALID [2022-04-27 10:47:36,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {34#(= main_~i~0 0)} is VALID [2022-04-27 10:47:36,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {35#(<= main_~n~0 0)} is VALID [2022-04-27 10:47:36,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(<= main_~n~0 0)} ~j~0 := 0; {36#(and (= main_~j~0 0) (<= main_~n~0 0))} is VALID [2022-04-27 10:47:36,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~j~0 0) (<= main_~n~0 0))} assume !!(~j~0 < ~n~0); {30#false} is VALID [2022-04-27 10:47:36,975 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30#false} is VALID [2022-04-27 10:47:36,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 10:47:36,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 10:47:36,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 10:47:36,977 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:47:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:36,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154470081] [2022-04-27 10:47:36,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154470081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:36,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:47:36,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:47:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192995878] [2022-04-27 10:47:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:36,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:36,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:37,048 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:47:37,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:47:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:47:37,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:47:37,066 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:37,283 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 10:47:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:47:37,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-27 10:47:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-27 10:47:37,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-04-27 10:47:37,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:37,353 INFO L225 Difference]: With dead ends: 47 [2022-04-27 10:47:37,354 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:47:37,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:47:37,360 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:37,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:47:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:47:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 10:47:37,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:37,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:37,379 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:37,380 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:37,381 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-27 10:47:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 10:47:37,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:37,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:37,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 10:47:37,382 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 10:47:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:37,384 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-27 10:47:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 10:47:37,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:37,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:37,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:37,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:47:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-27 10:47:37,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-27 10:47:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:37,389 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-27 10:47:37,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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:47:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 10:47:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:47:37,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:37,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:47:37,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash -174022606, now seen corresponding path program 1 times [2022-04-27 10:47:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142680775] [2022-04-27 10:47:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:37,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(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); {181#true} is VALID [2022-04-27 10:47:37,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:47:37,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #83#return; {181#true} is VALID [2022-04-27 10:47:37,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:37,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(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); {181#true} is VALID [2022-04-27 10:47:37,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:47:37,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} #83#return; {181#true} is VALID [2022-04-27 10:47:37,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {181#true} is VALID [2022-04-27 10:47:37,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {186#(<= 4000 main_~c1~0)} is VALID [2022-04-27 10:47:37,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:37,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:37,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:37,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(<= 4000 main_~k~0)} ~j~0 := 0; {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,487 INFO L272 TraceCheckUtils]: 13: Hoare triple {188#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {189#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:37,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {189#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {190#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:37,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {190#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {182#false} is VALID [2022-04-27 10:47:37,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-27 10:47:37,488 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:47:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:37,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142680775] [2022-04-27 10:47:37,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142680775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:37,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353228058] [2022-04-27 10:47:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:37,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:37,491 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:47:37,492 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:47:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:37,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:47:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:37,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:37,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-27 10:47:37,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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); {181#true} is VALID [2022-04-27 10:47:37,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:47:37,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} #83#return; {181#true} is VALID [2022-04-27 10:47:37,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {181#true} is VALID [2022-04-27 10:47:37,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {186#(<= 4000 main_~c1~0)} is VALID [2022-04-27 10:47:37,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:37,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:37,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:37,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(<= 4000 main_~k~0)} ~j~0 := 0; {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {188#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:37,766 INFO L272 TraceCheckUtils]: 13: Hoare triple {188#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:47:37,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:47:37,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {182#false} is VALID [2022-04-27 10:47:37,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-27 10:47:37,767 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:47:37,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:37,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-27 10:47:37,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {182#false} is VALID [2022-04-27 10:47:37,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:47:37,943 INFO L272 TraceCheckUtils]: 13: Hoare triple {255#(< 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:47:37,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#(< 0 main_~k~0)} assume !!(~j~0 < ~n~0); {255#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:37,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(< 0 main_~k~0)} ~j~0 := 0; {255#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:37,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#(< 0 main_~k~0)} assume !(~i~0 < ~n~0); {255#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:37,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(< 0 (+ main_~k~0 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {255#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:37,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(< 0 (+ main_~k~0 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {268#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-27 10:47:37,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(< 0 (+ main_~k~0 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {268#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-27 10:47:37,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {278#(< 0 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {268#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-27 10:47:37,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {278#(< 0 main_~c1~0)} is VALID [2022-04-27 10:47:37,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {181#true} is VALID [2022-04-27 10:47:37,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} #83#return; {181#true} is VALID [2022-04-27 10:47:37,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:47:37,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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); {181#true} is VALID [2022-04-27 10:47:37,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-27 10:47:37,948 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:47:37,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353228058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:37,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:37,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:47:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833410390] [2022-04-27 10:47:37,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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 17 [2022-04-27 10:47:37,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:37,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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:47:37,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:37,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:47:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:47:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:37,990 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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:47:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:38,489 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-27 10:47:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:47:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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 17 [2022-04-27 10:47:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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:47:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 10:47:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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:47:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 10:47:38,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 10:47:38,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:38,546 INFO L225 Difference]: With dead ends: 48 [2022-04-27 10:47:38,546 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 10:47:38,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:47:38,548 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:38,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 47 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:47:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 10:47:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-04-27 10:47:38,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:38,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:38,566 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:38,566 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:38,569 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 10:47:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-27 10:47:38,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:38,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:38,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 46 states. [2022-04-27 10:47:38,570 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 46 states. [2022-04-27 10:47:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:38,573 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 10:47:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-27 10:47:38,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:38,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:38,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:38,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-27 10:47:38,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2022-04-27 10:47:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:38,575 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-27 10:47:38,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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:47:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 10:47:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:47:38,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:38,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:38,604 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:47:38,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:38,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash 767622940, now seen corresponding path program 1 times [2022-04-27 10:47:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:38,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497725417] [2022-04-27 10:47:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {536#(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); {526#true} is VALID [2022-04-27 10:47:38,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-27 10:47:38,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {526#true} #83#return; {526#true} is VALID [2022-04-27 10:47:38,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:38,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {536#(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); {526#true} is VALID [2022-04-27 10:47:38,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-27 10:47:38,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #83#return; {526#true} is VALID [2022-04-27 10:47:38,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {526#true} is VALID [2022-04-27 10:47:38,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {531#(<= 2000 main_~c2~0)} is VALID [2022-04-27 10:47:38,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:38,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:38,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:38,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume !(0 == ~v~0); {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:38,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:38,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:38,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#(<= 2000 main_~k~0)} ~j~0 := 0; {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:38,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {533#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:38,865 INFO L272 TraceCheckUtils]: 14: Hoare triple {533#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:38,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:38,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {527#false} is VALID [2022-04-27 10:47:38,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-27 10:47:38,866 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:47:38,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497725417] [2022-04-27 10:47:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497725417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446011199] [2022-04-27 10:47:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:38,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:38,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:38,868 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:47:38,869 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:47:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:47:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:38,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:39,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-27 10:47:39,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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); {526#true} is VALID [2022-04-27 10:47:39,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-27 10:47:39,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #83#return; {526#true} is VALID [2022-04-27 10:47:39,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {526#true} is VALID [2022-04-27 10:47:39,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {531#(<= 2000 main_~c2~0)} is VALID [2022-04-27 10:47:39,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:39,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:39,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:39,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume !(0 == ~v~0); {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-27 10:47:39,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:39,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:39,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#(<= 2000 main_~k~0)} ~j~0 := 0; {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:39,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {533#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {533#(<= 2000 main_~k~0)} is VALID [2022-04-27 10:47:39,057 INFO L272 TraceCheckUtils]: 14: Hoare triple {533#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:47:39,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:47:39,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {527#false} is VALID [2022-04-27 10:47:39,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-27 10:47:39,058 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:47:39,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:39,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-27 10:47:39,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {527#false} is VALID [2022-04-27 10:47:39,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:47:39,197 INFO L272 TraceCheckUtils]: 14: Hoare triple {603#(< 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:47:39,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#(< 0 main_~k~0)} assume !!(~j~0 < ~n~0); {603#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:39,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#(< 0 main_~k~0)} ~j~0 := 0; {603#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:39,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#(< 0 main_~k~0)} assume !(~i~0 < ~n~0); {603#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:39,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {603#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:39,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} assume !(0 == ~v~0); {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-27 10:47:39,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-27 10:47:39,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-27 10:47:39,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {629#(< 0 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-27 10:47:39,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {629#(< 0 main_~c2~0)} is VALID [2022-04-27 10:47:39,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {526#true} is VALID [2022-04-27 10:47:39,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #83#return; {526#true} is VALID [2022-04-27 10:47:39,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-27 10:47:39,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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); {526#true} is VALID [2022-04-27 10:47:39,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-27 10:47:39,203 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:47:39,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446011199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:39,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:39,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:47:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749354364] [2022-04-27 10:47:39,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:39,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:39,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:47:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:47:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:39,231 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:39,914 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 10:47:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:47:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 10:47:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 10:47:39,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 10:47:39,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:39,967 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:47:39,967 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 10:47:39,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:47:39,968 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:39,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 75 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:47:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 10:47:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2022-04-27 10:47:39,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:39,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:39,989 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:39,989 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:39,992 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 10:47:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 10:47:39,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:39,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:39,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 59 states. [2022-04-27 10:47:39,993 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 59 states. [2022-04-27 10:47:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:39,995 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 10:47:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 10:47:39,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:39,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:39,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:39,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 10:47:39,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 18 [2022-04-27 10:47:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:39,997 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 10:47:39,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 10:47:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:47:39,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:39,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:40,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:47:40,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:47:40,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash -41723686, now seen corresponding path program 1 times [2022-04-27 10:47:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:40,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699955097] [2022-04-27 10:47:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:40,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#(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); {929#true} is VALID [2022-04-27 10:47:40,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-27 10:47:40,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {929#true} {929#true} #83#return; {929#true} is VALID [2022-04-27 10:47:40,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:40,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#(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); {929#true} is VALID [2022-04-27 10:47:40,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-27 10:47:40,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #83#return; {929#true} is VALID [2022-04-27 10:47:40,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {929#true} is VALID [2022-04-27 10:47:40,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {934#(<= 10000 main_~c3~0)} is VALID [2022-04-27 10:47:40,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {934#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-27 10:47:40,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-27 10:47:40,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-27 10:47:40,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !(0 == ~v~0); {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-27 10:47:40,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {936#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {936#(<= 10000 main_~k~0)} ~j~0 := 0; {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {936#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,300 INFO L272 TraceCheckUtils]: 14: Hoare triple {936#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {937#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:40,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {937#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {938#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:40,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {930#false} is VALID [2022-04-27 10:47:40,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-27 10:47:40,301 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:47:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:40,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699955097] [2022-04-27 10:47:40,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699955097] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:40,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606473736] [2022-04-27 10:47:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:40,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:40,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:47:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:40,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:47:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:40,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:40,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-27 10:47:40,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#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); {929#true} is VALID [2022-04-27 10:47:40,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-27 10:47:40,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #83#return; {929#true} is VALID [2022-04-27 10:47:40,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {929#true} is VALID [2022-04-27 10:47:40,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {934#(<= 10000 main_~c3~0)} is VALID [2022-04-27 10:47:40,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {934#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-27 10:47:40,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-27 10:47:40,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-27 10:47:40,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(0 == ~v~0); {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-27 10:47:40,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {936#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {936#(<= 10000 main_~k~0)} ~j~0 := 0; {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {936#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {936#(<= 10000 main_~k~0)} is VALID [2022-04-27 10:47:40,473 INFO L272 TraceCheckUtils]: 14: Hoare triple {936#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:47:40,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:47:40,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-27 10:47:40,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-27 10:47:40,474 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:47:40,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:47:40,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-27 10:47:40,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-27 10:47:40,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:47:40,634 INFO L272 TraceCheckUtils]: 14: Hoare triple {1006#(< 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:47:40,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {1006#(< 0 main_~k~0)} assume !!(~j~0 < ~n~0); {1006#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:40,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(< 0 main_~k~0)} ~j~0 := 0; {1006#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:40,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(< 0 main_~k~0)} assume !(~i~0 < ~n~0); {1006#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:40,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {1006#(< 0 main_~k~0)} is VALID [2022-04-27 10:47:40,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} assume !(0 == ~v~0); {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-27 10:47:40,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-27 10:47:40,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-27 10:47:40,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {1032#(< 0 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-27 10:47:40,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1032#(< 0 main_~c3~0)} is VALID [2022-04-27 10:47:40,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {929#true} is VALID [2022-04-27 10:47:40,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #83#return; {929#true} is VALID [2022-04-27 10:47:40,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-27 10:47:40,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#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); {929#true} is VALID [2022-04-27 10:47:40,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-27 10:47:40,638 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:47:40,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606473736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:47:40,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:47:40,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:47:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516531080] [2022-04-27 10:47:40,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:47:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:40,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:40,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:40,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:40,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:47:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:47:40,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:47:40,665 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:41,242 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-27 10:47:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:47:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 10:47:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 10:47:41,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 10:47:41,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:41,288 INFO L225 Difference]: With dead ends: 65 [2022-04-27 10:47:41,288 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 10:47:41,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:47:41,289 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:41,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 70 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:47:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 10:47:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2022-04-27 10:47:41,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:41,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,320 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,320 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:41,322 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-27 10:47:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-27 10:47:41,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:41,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:41,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-27 10:47:41,323 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-27 10:47:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:41,325 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-27 10:47:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-27 10:47:41,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:41,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:41,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:41,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-27 10:47:41,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2022-04-27 10:47:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:41,327 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-27 10:47:41,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:47:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-27 10:47:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:47:41,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:41,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:41,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:47:41,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:41,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2044959957, now seen corresponding path program 1 times [2022-04-27 10:47:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:41,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395333987] [2022-04-27 10:47:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:41,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:41,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1359#(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); {1351#true} is VALID [2022-04-27 10:47:41,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-04-27 10:47:41,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1351#true} {1351#true} #83#return; {1351#true} is VALID [2022-04-27 10:47:41,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:41,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#(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); {1351#true} is VALID [2022-04-27 10:47:41,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-04-27 10:47:41,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #83#return; {1351#true} is VALID [2022-04-27 10:47:41,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1351#true} is VALID [2022-04-27 10:47:41,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1351#true} is VALID [2022-04-27 10:47:41,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1356#(= main_~i~0 0)} is VALID [2022-04-27 10:47:41,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1357#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:41,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {1357#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1358#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 10:47:41,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1358#(<= main_~n~0 main_~i~0)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1358#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 10:47:41,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1352#false} is VALID [2022-04-27 10:47:41,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1352#false} is VALID [2022-04-27 10:47:41,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#false} assume !(0 == ~v~0); {1352#false} is VALID [2022-04-27 10:47:41,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#false} assume !(~i~0 < ~n~0); {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#false} ~j~0 := 0; {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !!(~j~0 < ~n~0); {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L272 TraceCheckUtils]: 17: Hoare triple {1352#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {1352#false} assume 0 == ~cond; {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2022-04-27 10:47:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:47:41,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:41,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395333987] [2022-04-27 10:47:41,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395333987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:41,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667005424] [2022-04-27 10:47:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:41,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:41,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:41,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:41,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:47:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:41,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:47:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:41,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:41,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2022-04-27 10:47:41,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#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); {1351#true} is VALID [2022-04-27 10:47:41,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-04-27 10:47:41,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #83#return; {1351#true} is VALID [2022-04-27 10:47:41,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1351#true} is VALID [2022-04-27 10:47:41,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1351#true} is VALID [2022-04-27 10:47:41,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1381#(<= 0 main_~i~0)} is VALID [2022-04-27 10:47:41,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1381#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1357#(<= 1 main_~i~0)} is VALID [2022-04-27 10:47:41,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {1357#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-27 10:47:41,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#false} assume !(0 == ~v~0); {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#false} assume !(~i~0 < ~n~0); {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#false} ~j~0 := 0; {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !!(~j~0 < ~n~0); {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L272 TraceCheckUtils]: 17: Hoare triple {1352#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1352#false} is VALID [2022-04-27 10:47:41,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2022-04-27 10:47:41,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {1352#false} assume 0 == ~cond; {1352#false} is VALID [2022-04-27 10:47:41,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2022-04-27 10:47:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:47:41,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:47:41,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667005424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:41,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:47:41,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-04-27 10:47:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371519582] [2022-04-27 10:47:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:41,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:47:41,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:41,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:41,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:47:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:47:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:41,751 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:41,811 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-27 10:47:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:47:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:47:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 10:47:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 10:47:41,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-27 10:47:41,835 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:47:41,836 INFO L225 Difference]: With dead ends: 68 [2022-04-27 10:47:41,836 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:47:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:47:41,837 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:41,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:47:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:47:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-27 10:47:41,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:41,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,873 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,874 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:41,875 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:47:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:47:41,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:41,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:41,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-27 10:47:41,876 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-27 10:47:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:41,877 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:47:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:47:41,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:41,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:41,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:41,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:47:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 10:47:41,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2022-04-27 10:47:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:41,880 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 10:47:41,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:47:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 10:47:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:47:41,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:47:41,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:47:41,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:47:42,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:42,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:47:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:47:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -819973646, now seen corresponding path program 1 times [2022-04-27 10:47:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:47:42,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508131979] [2022-04-27 10:47:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:47:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:47:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:42,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#(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); {1631#true} is VALID [2022-04-27 10:47:42,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2022-04-27 10:47:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:47:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:42,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2022-04-27 10:47:42,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} assume !(0 == ~cond); {1631#true} is VALID [2022-04-27 10:47:42,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1638#(<= 4000 main_~k~0)} #81#return; {1638#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:42,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 10:47:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:42,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2022-04-27 10:47:42,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} assume !(0 == ~cond); {1631#true} is VALID [2022-04-27 10:47:42,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1643#(<= 3999 main_~k~0)} #81#return; {1643#(<= 3999 main_~k~0)} is VALID [2022-04-27 10:47:42,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1651#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:47:42,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#(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); {1631#true} is VALID [2022-04-27 10:47:42,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2022-04-27 10:47:42,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1631#true} is VALID [2022-04-27 10:47:42,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {1631#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1636#(<= 4000 main_~c1~0)} is VALID [2022-04-27 10:47:42,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {1636#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:42,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:42,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-27 10:47:42,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1638#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:42,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {1638#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:42,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(<= 4000 main_~k~0)} ~j~0 := 0; {1638#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:42,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {1638#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {1638#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:42,193 INFO L272 TraceCheckUtils]: 13: Hoare triple {1638#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1631#true} is VALID [2022-04-27 10:47:42,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2022-04-27 10:47:42,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#true} assume !(0 == ~cond); {1631#true} is VALID [2022-04-27 10:47:42,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,194 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1631#true} {1638#(<= 4000 main_~k~0)} #81#return; {1638#(<= 4000 main_~k~0)} is VALID [2022-04-27 10:47:42,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(<= 4000 main_~k~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1643#(<= 3999 main_~k~0)} is VALID [2022-04-27 10:47:42,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1643#(<= 3999 main_~k~0)} assume !!(~j~0 < ~n~0); {1643#(<= 3999 main_~k~0)} is VALID [2022-04-27 10:47:42,195 INFO L272 TraceCheckUtils]: 20: Hoare triple {1643#(<= 3999 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1631#true} is VALID [2022-04-27 10:47:42,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2022-04-27 10:47:42,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#true} assume !(0 == ~cond); {1631#true} is VALID [2022-04-27 10:47:42,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,195 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1631#true} {1643#(<= 3999 main_~k~0)} #81#return; {1643#(<= 3999 main_~k~0)} is VALID [2022-04-27 10:47:42,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {1643#(<= 3999 main_~k~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1648#(<= 3998 main_~k~0)} is VALID [2022-04-27 10:47:42,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {1648#(<= 3998 main_~k~0)} assume !!(~j~0 < ~n~0); {1648#(<= 3998 main_~k~0)} is VALID [2022-04-27 10:47:42,197 INFO L272 TraceCheckUtils]: 27: Hoare triple {1648#(<= 3998 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1649#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:47:42,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {1649#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1650#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:47:42,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {1650#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1632#false} is VALID [2022-04-27 10:47:42,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2022-04-27 10:47:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:47:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:47:42,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508131979] [2022-04-27 10:47:42,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508131979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:47:42,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045924359] [2022-04-27 10:47:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:47:42,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:47:42,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:47:42,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:47:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:42,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:47:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:47:42,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:47:42,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2022-04-27 10:47:42,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#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); {1631#true} is VALID [2022-04-27 10:47:42,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2022-04-27 10:47:42,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1631#true} is VALID [2022-04-27 10:47:42,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1631#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1631#true} is VALID [2022-04-27 10:47:42,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {1631#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1631#true} is VALID [2022-04-27 10:47:42,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1631#true} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1631#true} is VALID [2022-04-27 10:47:42,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1631#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {1679#(< main_~n~0 2)} is VALID [2022-04-27 10:47:42,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1679#(< main_~n~0 2)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1679#(< main_~n~0 2)} is VALID [2022-04-27 10:47:42,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(< main_~n~0 2)} assume !(~i~0 < ~n~0); {1679#(< main_~n~0 2)} is VALID [2022-04-27 10:47:42,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {1679#(< main_~n~0 2)} ~j~0 := 0; {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-27 10:47:42,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} assume !!(~j~0 < ~n~0); {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-27 10:47:42,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1631#true} is VALID [2022-04-27 10:47:42,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2022-04-27 10:47:42,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#true} assume !(0 == ~cond); {1631#true} is VALID [2022-04-27 10:47:42,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {1631#true} assume true; {1631#true} is VALID [2022-04-27 10:47:42,371 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1631#true} {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} #81#return; {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-27 10:47:42,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1711#(and (<= 1 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-27 10:47:42,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {1711#(and (<= 1 main_~j~0) (< main_~n~0 2))} assume !!(~j~0 < ~n~0); {1632#false} is VALID [2022-04-27 10:47:42,372 INFO L272 TraceCheckUtils]: 20: Hoare triple {1632#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1632#false} is VALID [2022-04-27 10:47:42,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {1632#false} ~cond := #in~cond; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {1632#false} assume !(0 == ~cond); {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {1632#false} assume true; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1632#false} {1632#false} #81#return; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {1632#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {1632#false} assume !!(~j~0 < ~n~0); {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L272 TraceCheckUtils]: 27: Hoare triple {1632#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {1632#false} ~cond := #in~cond; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {1632#false} assume 0 == ~cond; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2022-04-27 10:47:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:47:42,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:47:42,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045924359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:47:42,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:47:42,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-04-27 10:47:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931522984] [2022-04-27 10:47:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:47:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-04-27 10:47:42,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:47:42,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:47:42,391 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:47:42,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:47:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:47:42,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:47:42,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:47:42,392 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:47:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:42,462 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 10:47:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:47:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-04-27 10:47:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:47:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:47:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 10:47:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:47:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 10:47:42,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 10:47:42,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:47:42,483 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:47:42,483 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:47:42,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:47:42,484 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:47:42,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:47:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:47:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:47:42,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:47:42,485 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:47:42,485 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:47:42,485 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:47:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:42,485 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:47:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:47:42,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:42,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:42,486 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:47:42,486 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:47:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:47:42,486 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:47:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:47:42,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:42,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:47:42,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:47:42,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:47:42,486 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:47:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:47:42,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2022-04-27 10:47:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:47:42,486 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:47:42,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:47:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:47:42,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:47:42,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:47:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:47:42,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:47:42,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:47:42,879 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 52) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 52) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L895 garLoopResultBuilder]: At program point L46-2(lines 46 50) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (< main_~n~0 2)) (.cse3 (<= 2000 main_~c2~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 (<= 1 main_~j~0) .cse1 .cse2 .cse3 (< 0 main_~k~0) .cse4) (and .cse0 (<= 0 main_~j~0) (<= 2000 main_~k~0) .cse1 .cse2 .cse3 .cse4) (and (= main_~j~0 0) (= main_~i~0 0) (<= main_~n~0 0)))) [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point L46-3(lines 46 50) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 43) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 43) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 34 44) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (<= 2000 main_~c2~0))) (or (and .cse0 (<= 2000 main_~k~0) .cse1 (< main_~n~0 2) .cse2 (<= 1 main_~i~0)) (and .cse0 (= main_~k~0 0) .cse1 (= main_~i~0 0) .cse2))) [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 44) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 52) the Hoare annotation is: true [2022-04-27 10:47:42,880 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 0 main_~j~0) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 10:47:42,880 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:47:42,881 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:47:42,881 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:47:42,881 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:47:42,881 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:47:42,883 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 10:47:42,884 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:47:42,887 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:47:42,887 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:47:42,887 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:47:42,887 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:47:42,887 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:47:42,887 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:47:42,888 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 10:47:42,889 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 10:47:42,904 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:47:42,904 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:47:42,904 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 10:47:42,904 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 10:47:42,904 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 10:47:42,904 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 10:47:42,905 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 10:47:42,905 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:47:42,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:47:42 BoogieIcfgContainer [2022-04-27 10:47:42,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:47:42,911 INFO L158 Benchmark]: Toolchain (without parser) took 6942.66ms. Allocated memory was 201.3MB in the beginning and 245.4MB in the end (delta: 44.0MB). Free memory was 151.8MB in the beginning and 223.4MB in the end (delta: -71.6MB). Peak memory consumption was 116.7MB. Max. memory is 8.0GB. [2022-04-27 10:47:42,911 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:47:42,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.25ms. Allocated memory is still 201.3MB. Free memory was 151.6MB in the beginning and 176.4MB in the end (delta: -24.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 10:47:42,912 INFO L158 Benchmark]: Boogie Preprocessor took 44.22ms. Allocated memory is still 201.3MB. Free memory was 176.4MB in the beginning and 174.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:47:42,912 INFO L158 Benchmark]: RCFGBuilder took 352.04ms. Allocated memory is still 201.3MB. Free memory was 174.8MB in the beginning and 162.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:47:42,912 INFO L158 Benchmark]: TraceAbstraction took 6300.85ms. Allocated memory was 201.3MB in the beginning and 245.4MB in the end (delta: 44.0MB). Free memory was 161.7MB in the beginning and 223.4MB in the end (delta: -61.7MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. [2022-04-27 10:47:42,913 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 201.3MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.25ms. Allocated memory is still 201.3MB. Free memory was 151.6MB in the beginning and 176.4MB in the end (delta: -24.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.22ms. Allocated memory is still 201.3MB. Free memory was 176.4MB in the beginning and 174.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 352.04ms. Allocated memory is still 201.3MB. Free memory was 174.8MB in the beginning and 162.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6300.85ms. Allocated memory was 201.3MB in the beginning and 245.4MB in the end (delta: 44.0MB). Free memory was 161.7MB in the beginning and 223.4MB in the end (delta: -61.7MB). Peak memory consumption was 126.4MB. 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 145 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 124 HoareAnnotationTreeSize, 14 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 400 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 9 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 33/51 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: 34]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= k) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i) || ((((10000 <= c3 && k == 0) && 4000 <= c1) && i == 0) && 2000 <= c2) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((10000 <= c3 && 1 <= j) && 4000 <= c1) && n < 2) && 2000 <= c2) && 0 < k) && 1 <= i) || ((((((10000 <= c3 && 0 <= j) && 2000 <= k) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i)) || ((j == 0 && i == 0) && n <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:47:42,942 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...