/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/nla-digbench-scaling/geo1-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:20:53,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:20:53,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:20:53,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:20:53,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:20:53,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:20:53,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:20:53,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:20:53,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:20:53,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:20:53,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:20:53,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:20:53,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:20:53,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:20:53,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:20:53,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:20:53,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:20:53,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:20:53,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:20:53,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:20:53,248 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:20:53,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:20:53,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:20:53,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:20:53,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:20:53,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:20:53,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:20:53,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:20:53,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:20:53,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:20:53,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:20:53,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:20:53,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:20:53,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:20:53,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:20:53,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:20:53,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:20:53,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:20:53,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:20:53,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:20:53,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:20:53,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:20:53,260 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 13:20:53,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:20:53,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:20:53,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:20:53,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:20:53,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:20:53,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:20:53,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:20:53,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:20:53,274 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:20:53,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:20:53,274 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:20:53,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:20:53,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:20:53,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:20:53,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:20:53,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:20:53,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:20:53,277 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 13:20:53,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:20:53,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:20:53,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:20:53,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:20:53,435 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:20:53,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c [2022-04-27 13:20:53,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75da850d/7fad2aa79873464898c765b7bb7ece45/FLAG9b1a6a5bc [2022-04-27 13:20:53,821 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:20:53,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c [2022-04-27 13:20:53,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75da850d/7fad2aa79873464898c765b7bb7ece45/FLAG9b1a6a5bc [2022-04-27 13:20:53,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75da850d/7fad2aa79873464898c765b7bb7ece45 [2022-04-27 13:20:53,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:20:53,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:20:53,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:20:53,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:20:53,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:20:53,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:20:53" (1/1) ... [2022-04-27 13:20:53,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfba0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:53, skipping insertion in model container [2022-04-27 13:20:53,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:20:53" (1/1) ... [2022-04-27 13:20:53,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:20:53,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:20:53,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c[546,559] [2022-04-27 13:20:53,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:20:53,989 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:20:53,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c[546,559] [2022-04-27 13:20:54,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:20:54,008 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:20:54,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54 WrapperNode [2022-04-27 13:20:54,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:20:54,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:20:54,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:20:54,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:20:54,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:20:54,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:20:54,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:20:54,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:20:54,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (1/1) ... [2022-04-27 13:20:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:20:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:54,051 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 13:20:54,057 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 13:20:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:20:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:20:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:20:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:20:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:20:54,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:20:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:20:54,118 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:20:54,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:20:54,205 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:20:54,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:20:54,211 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:20:54,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:20:54 BoogieIcfgContainer [2022-04-27 13:20:54,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:20:54,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:20:54,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:20:54,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:20:54,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:20:53" (1/3) ... [2022-04-27 13:20:54,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a666f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:20:54, skipping insertion in model container [2022-04-27 13:20:54,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:54" (2/3) ... [2022-04-27 13:20:54,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a666f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:20:54, skipping insertion in model container [2022-04-27 13:20:54,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:20:54" (3/3) ... [2022-04-27 13:20:54,217 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound20.c [2022-04-27 13:20:54,225 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:20:54,226 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:20:54,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:20:54,257 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@54aab357, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14a0e241 [2022-04-27 13:20:54,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:20:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:20:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:20:54,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:54,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:54,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 774216096, now seen corresponding path program 1 times [2022-04-27 13:20:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:54,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915230961] [2022-04-27 13:20:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:20:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(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(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 13:20:54,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:20:54,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-27 13:20:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:20:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-27 13:20:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:20:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-27 13:20:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:20:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-27 13:20:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:20:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-27 13:20:54,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:20:54,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(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(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 13:20:54,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:20:54,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-27 13:20:54,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 13:20:54,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-27 13:20:54,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 20 then 1 else 0)); {35#true} is VALID [2022-04-27 13:20:54,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-27 13:20:54,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 13:20:54,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {35#true} is VALID [2022-04-27 13:20:54,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,545 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-27 13:20:54,545 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 13:20:54,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,546 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-27 13:20:54,546 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 13:20:54,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:20:54,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:20:54,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:20:54,547 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-27 13:20:54,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {36#false} is VALID [2022-04-27 13:20:54,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 13:20:54,548 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {36#false} is VALID [2022-04-27 13:20:54,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 13:20:54,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 13:20:54,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 13:20:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:20:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:54,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915230961] [2022-04-27 13:20:54,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915230961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:20:54,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:20:54,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:20:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434102779] [2022-04-27 13:20:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:20:54,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:20:54,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:54,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:20:54,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:54,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:20:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:20:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:20:54,616 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:20:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:54,734 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-27 13:20:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:20:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:20:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:20:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-27 13:20:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:20:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-27 13:20:54,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-27 13:20:54,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:54,835 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:20:54,835 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:20:54,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:20:54,839 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:20:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:20:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:20:54,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:54,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:20:54,878 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:20:54,878 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:20:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:54,881 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:20:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:20:54,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:54,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:54,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-27 13:20:54,883 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-27 13:20:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:54,886 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:20:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:20:54,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:54,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:54,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:54,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:20:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 13:20:54,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-04-27 13:20:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:54,890 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 13:20:54,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:20:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:20:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:20:54,895 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:54,895 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:54,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:20:54,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1105237916, now seen corresponding path program 1 times [2022-04-27 13:20:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:54,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309049496] [2022-04-27 13:20:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:54,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:54,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968859945] [2022-04-27 13:20:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:54,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:54,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:54,939 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 13:20:54,949 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 13:20:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:54,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:20:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:55,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:55,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 13:20:55,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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(10, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-27 13:20:55,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:20:55,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #68#return; {231#true} is VALID [2022-04-27 13:20:55,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-27 13:20:55,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {231#true} is VALID [2022-04-27 13:20:55,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 20 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:55,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:20:55,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:20:55,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:20:55,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {231#true} {231#true} #56#return; {231#true} is VALID [2022-04-27 13:20:55,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {231#true} is VALID [2022-04-27 13:20:55,169 INFO L272 TraceCheckUtils]: 12: Hoare triple {231#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:55,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:20:55,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:20:55,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:20:55,169 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#true} {231#true} #58#return; {231#true} is VALID [2022-04-27 13:20:55,169 INFO L272 TraceCheckUtils]: 17: Hoare triple {231#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:55,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:20:55,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:20:55,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:20:55,170 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {231#true} {231#true} #60#return; {231#true} is VALID [2022-04-27 13:20:55,170 INFO L272 TraceCheckUtils]: 22: Hoare triple {231#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:55,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:20:55,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:20:55,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:20:55,170 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {231#true} #62#return; {231#true} is VALID [2022-04-27 13:20:55,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {231#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:20:55,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} assume !false; {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:20:55,172 INFO L272 TraceCheckUtils]: 29: Hoare triple {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {324#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:20:55,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {324#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {328#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:55,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {328#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 13:20:55,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 13:20:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:20:55,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:20:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309049496] [2022-04-27 13:20:55,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968859945] [2022-04-27 13:20:55,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968859945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:20:55,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:20:55,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:20:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722270266] [2022-04-27 13:20:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:20:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:20:55,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:55,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:20:55,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:55,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:20:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:20:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:20:55,196 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:20:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:55,311 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 13:20:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:20:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:20:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:20:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 13:20:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:20:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 13:20:55,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-27 13:20:55,350 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 13:20:55,353 INFO L225 Difference]: With dead ends: 37 [2022-04-27 13:20:55,353 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:20:55,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:20:55,357 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:55,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:20:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:20:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-27 13:20:55,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:55,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:20:55,372 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:20:55,372 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:20:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:55,374 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 13:20:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 13:20:55,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:55,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:55,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-27 13:20:55,375 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-27 13:20:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:55,377 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 13:20:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 13:20:55,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:55,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:55,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:55,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:20:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 13:20:55,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2022-04-27 13:20:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:55,380 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 13:20:55,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:20:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 13:20:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 13:20:55,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:55,381 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:55,397 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 13:20:55,588 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 13:20:55,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1493430927, now seen corresponding path program 1 times [2022-04-27 13:20:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718055790] [2022-04-27 13:20:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:55,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:55,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331645409] [2022-04-27 13:20:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:55,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:55,621 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 13:20:55,623 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 13:20:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:55,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:20:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:55,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:00,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2022-04-27 13:21:00,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#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(10, 2);call #Ultimate.allocInit(12, 3); {508#true} is VALID [2022-04-27 13:21:00,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:00,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #68#return; {508#true} is VALID [2022-04-27 13:21:00,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret6 := main(); {508#true} is VALID [2022-04-27 13:21:00,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {508#true} is VALID [2022-04-27 13:21:00,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {508#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 20 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:00,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:00,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:00,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:00,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {508#true} {508#true} #56#return; {508#true} is VALID [2022-04-27 13:21:00,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {508#true} is VALID [2022-04-27 13:21:00,101 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:00,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:00,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:00,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:00,102 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#true} {508#true} #58#return; {508#true} is VALID [2022-04-27 13:21:00,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {508#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:00,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:00,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:00,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:00,102 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {508#true} {508#true} #60#return; {508#true} is VALID [2022-04-27 13:21:00,102 INFO L272 TraceCheckUtils]: 22: Hoare triple {508#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:00,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:00,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:00,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:00,103 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {508#true} {508#true} #62#return; {508#true} is VALID [2022-04-27 13:21:00,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {508#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {508#true} is VALID [2022-04-27 13:21:00,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {508#true} assume !false; {508#true} is VALID [2022-04-27 13:21:00,103 INFO L272 TraceCheckUtils]: 29: Hoare triple {508#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:00,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {508#true} ~cond := #in~cond; {603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:00,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:00,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:00,105 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} {508#true} #64#return; {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:21:00,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:21:00,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {621#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-27 13:21:00,112 INFO L272 TraceCheckUtils]: 36: Hoare triple {621#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:00,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:00,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {509#false} is VALID [2022-04-27 13:21:00,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {509#false} assume !false; {509#false} is VALID [2022-04-27 13:21:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:21:00,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:05,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {509#false} assume !false; {509#false} is VALID [2022-04-27 13:21:05,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {509#false} is VALID [2022-04-27 13:21:05,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:05,514 INFO L272 TraceCheckUtils]: 36: Hoare triple {645#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:05,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {645#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 13:21:05,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:21:05,516 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} {508#true} #64#return; {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:21:05,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:05,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:05,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {508#true} ~cond := #in~cond; {664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:21:05,517 INFO L272 TraceCheckUtils]: 29: Hoare triple {508#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:05,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {508#true} assume !false; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {508#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {508#true} {508#true} #62#return; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:05,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L272 TraceCheckUtils]: 22: Hoare triple {508#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:05,518 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {508#true} {508#true} #60#return; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:05,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:05,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:05,519 INFO L272 TraceCheckUtils]: 17: Hoare triple {508#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:05,519 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#true} {508#true} #58#return; {508#true} is VALID [2022-04-27 13:21:05,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:05,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:05,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:05,519 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:05,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {508#true} is VALID [2022-04-27 13:21:05,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {508#true} {508#true} #56#return; {508#true} is VALID [2022-04-27 13:21:05,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:05,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#true} assume !(0 == ~cond); {508#true} is VALID [2022-04-27 13:21:05,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {508#true} ~cond := #in~cond; {508#true} is VALID [2022-04-27 13:21:05,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {508#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 20 then 1 else 0)); {508#true} is VALID [2022-04-27 13:21:05,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {508#true} is VALID [2022-04-27 13:21:05,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret6 := main(); {508#true} is VALID [2022-04-27 13:21:05,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #68#return; {508#true} is VALID [2022-04-27 13:21:05,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-27 13:21:05,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#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(10, 2);call #Ultimate.allocInit(12, 3); {508#true} is VALID [2022-04-27 13:21:05,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2022-04-27 13:21:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:21:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:05,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718055790] [2022-04-27 13:21:05,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:05,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331645409] [2022-04-27 13:21:05,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331645409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:21:05,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:21:05,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:21:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793030897] [2022-04-27 13:21:05,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:21:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-27 13:21:05,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:05,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 13:21:05,556 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 13:21:05,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:21:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:21:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:21:05,557 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 13:21:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:05,730 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 13:21:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:21:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-27 13:21:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 13:21:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-27 13:21:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 13:21:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-27 13:21:05,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-27 13:21:05,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:05,770 INFO L225 Difference]: With dead ends: 33 [2022-04-27 13:21:05,770 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:21:05,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:21:05,771 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:05,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:21:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:21:05,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:05,772 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 13:21:05,772 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 13:21:05,772 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 13:21:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:05,772 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:05,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:05,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:05,772 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 13:21:05,773 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 13:21:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:05,773 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:05,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:05,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:05,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:05,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:05,773 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 13:21:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:21:05,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-27 13:21:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:05,773 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:21:05,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 13:21:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:05,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:05,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:05,795 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 13:21:05,979 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 13:21:05,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:21:06,021 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-27 13:21:06,022 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-27 13:21:06,022 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-27 13:21:06,022 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-27 13:21:06,024 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-04-27 13:21:06,024 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-04-27 13:21:06,024 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-27 13:21:06,024 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-27 13:21:06,024 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 52) no Hoare annotation was computed. [2022-04-27 13:21:06,026 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (= (+ main_~x~0 1) main_~y~0) [2022-04-27 13:21:06,026 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-04-27 13:21:06,026 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 52) no Hoare annotation was computed. [2022-04-27 13:21:06,026 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-27 13:21:06,026 INFO L899 garLoopResultBuilder]: For program point L36-3(lines 36 46) no Hoare annotation was computed. [2022-04-27 13:21:06,026 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-27 13:21:06,026 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 52) the Hoare annotation is: true [2022-04-27 13:21:06,026 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-27 13:21:06,026 INFO L902 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-27 13:21:06,027 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 36 46) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:06,027 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 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:21:06,027 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-04-27 13:21:06,027 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-27 13:21:06,028 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-04-27 13:21:06,028 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-04-27 13:21:06,028 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-04-27 13:21:06,030 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 13:21:06,031 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:06,033 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:06,033 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:06,039 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:06,040 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 13:21:06,041 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 13:21:06,042 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 13:21:06,042 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:06,042 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 13:21:06,042 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-27 13:21:06,042 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:06,042 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:21:06,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:06 BoogieIcfgContainer [2022-04-27 13:21:06,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:06,060 INFO L158 Benchmark]: Toolchain (without parser) took 12214.72ms. Allocated memory was 208.7MB in the beginning and 265.3MB in the end (delta: 56.6MB). Free memory was 158.6MB in the beginning and 121.0MB in the end (delta: 37.6MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2022-04-27 13:21:06,060 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 208.7MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:06,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.42ms. Allocated memory is still 208.7MB. Free memory was 158.3MB in the beginning and 184.2MB in the end (delta: -25.8MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 13:21:06,060 INFO L158 Benchmark]: Boogie Preprocessor took 17.24ms. Allocated memory is still 208.7MB. Free memory was 184.2MB in the beginning and 182.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:06,061 INFO L158 Benchmark]: RCFGBuilder took 184.92ms. Allocated memory is still 208.7MB. Free memory was 182.3MB in the beginning and 171.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:06,061 INFO L158 Benchmark]: TraceAbstraction took 11845.76ms. Allocated memory was 208.7MB in the beginning and 265.3MB in the end (delta: 56.6MB). Free memory was 170.8MB in the beginning and 121.0MB in the end (delta: 49.8MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2022-04-27 13:21:06,062 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.11ms. Allocated memory is still 208.7MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.42ms. Allocated memory is still 208.7MB. Free memory was 158.3MB in the beginning and 184.2MB in the end (delta: -25.8MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.24ms. Allocated memory is still 208.7MB. Free memory was 184.2MB in the beginning and 182.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 184.92ms. Allocated memory is still 208.7MB. Free memory was 182.3MB in the beginning and 171.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11845.76ms. Allocated memory was 208.7MB in the beginning and 265.3MB in the end (delta: 56.6MB). Free memory was 170.8MB in the beginning and 121.0MB in the end (delta: 49.8MB). Peak memory consumption was 107.2MB. 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: 18]: 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 81 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 23 PreInvPairs, 31 NumberOfFragments, 39 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 1 QuantifiedInterpolants, 246 SizeOfPredicates, 4 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 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: 36]: Loop Invariant Derived loop invariant: z * x + 1 == y + x RESULT: Ultimate proved your program to be correct! [2022-04-27 13:21:06,079 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...