/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 18:44:30,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 18:44:30,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 18:44:30,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 18:44:30,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 18:44:30,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 18:44:30,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 18:44:30,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 18:44:30,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 18:44:30,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 18:44:30,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 18:44:30,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 18:44:30,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 18:44:30,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 18:44:30,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 18:44:30,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 18:44:30,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 18:44:30,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 18:44:30,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 18:44:30,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 18:44:30,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 18:44:30,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 18:44:30,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 18:44:30,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 18:44:30,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 18:44:30,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 18:44:30,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 18:44:30,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 18:44:30,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 18:44:30,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 18:44:30,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 18:44:30,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 18:44:30,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 18:44:30,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 18:44:30,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 18:44:30,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 18:44:30,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 18:44:30,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 18:44:30,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 18:44:30,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 18:44:30,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 18:44:30,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 18:44:30,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 18:44:30,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 18:44:30,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 18:44:31,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 18:44:31,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 18:44:31,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 18:44:31,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 18:44:31,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 18:44:31,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 18:44:31,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 18:44:31,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 18:44:31,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 18:44:31,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 18:44:31,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:44:31,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 18:44:31,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 18:44:31,003 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 18:44:31,003 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 18:44:31,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 18:44:31,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 18:44:31,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 18:44:31,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 18:44:31,224 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 18:44:31,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound1.c [2022-04-27 18:44:31,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2148511/816709ecfaa643a3b414eb5dfee33509/FLAGe1c7be382 [2022-04-27 18:44:31,590 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 18:44:31,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound1.c [2022-04-27 18:44:31,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2148511/816709ecfaa643a3b414eb5dfee33509/FLAGe1c7be382 [2022-04-27 18:44:32,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2148511/816709ecfaa643a3b414eb5dfee33509 [2022-04-27 18:44:32,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 18:44:32,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 18:44:32,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 18:44:32,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 18:44:32,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 18:44:32,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d74b148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 18:44:32,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 18:44:32,148 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_valuebound1.c[546,559] [2022-04-27 18:44:32,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:44:32,166 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 18:44:32,174 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_valuebound1.c[546,559] [2022-04-27 18:44:32,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:44:32,186 INFO L208 MainTranslator]: Completed translation [2022-04-27 18:44:32,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32 WrapperNode [2022-04-27 18:44:32,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 18:44:32,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 18:44:32,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 18:44:32,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 18:44:32,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 18:44:32,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 18:44:32,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 18:44:32,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 18:44:32,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:44:32,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:32,233 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 18:44:32,240 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 18:44:32,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 18:44:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 18:44:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 18:44:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 18:44:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 18:44:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 18:44:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 18:44:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 18:44:32,309 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 18:44:32,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 18:44:32,434 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 18:44:32,441 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 18:44:32,441 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 18:44:32,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:32 BoogieIcfgContainer [2022-04-27 18:44:32,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 18:44:32,443 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 18:44:32,443 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 18:44:32,443 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 18:44:32,445 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,447 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 18:44:32,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:44:32 BasicIcfg [2022-04-27 18:44:32,475 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 18:44:32,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 18:44:32,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 18:44:32,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 18:44:32,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 06:44:32" (1/4) ... [2022-04-27 18:44:32,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281330bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (2/4) ... [2022-04-27 18:44:32,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281330bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:32" (3/4) ... [2022-04-27 18:44:32,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281330bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:44:32" (4/4) ... [2022-04-27 18:44:32,490 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound1.cJordan [2022-04-27 18:44:32,498 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 18:44:32,499 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 18:44:32,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 18:44:32,536 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@21538bab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46041838 [2022-04-27 18:44:32,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 18:44:32,553 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 18:44:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 18:44:32,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:32,559 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 18:44:32,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1950279688, now seen corresponding path program 1 times [2022-04-27 18:44:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952287031] [2022-04-27 18:44:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:32,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 18:44:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:32,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID [2022-04-27 18:44:32,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-27 18:44:32,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-27 18:44:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 18:44:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:32,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 18:44:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:32,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 18:44:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:32,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 18:44:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:32,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 18:44:32,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID [2022-04-27 18:44:32,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-27 18:44:32,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-27 18:44:32,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-27 18:44:32,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {35#true} is VALID [2022-04-27 18:44:32,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-27 18:44:32,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {36#false} is VALID [2022-04-27 18:44:32,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-27 18:44:32,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,831 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,831 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-27 18:44:32,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,833 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,833 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-27 18:44:32,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-27 18:44:32,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,835 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-27 18:44:32,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {36#false} is VALID [2022-04-27 18:44:32,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,836 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {36#false} is VALID [2022-04-27 18:44:32,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {36#false} is VALID [2022-04-27 18:44:32,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-27 18:44:32,837 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 18:44:32,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:32,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952287031] [2022-04-27 18:44:32,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952287031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:44:32,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:44:32,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 18:44:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881158227] [2022-04-27 18:44:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:44:32,844 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 18:44:32,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:32,850 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 18:44:32,894 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 18:44:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 18:44:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:32,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 18:44:32,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:44:32,917 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 18:44:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,023 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 18:44:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 18:44:33,024 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 18:44:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:33,025 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 18:44:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 18:44:33,030 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 18:44:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 18:44:33,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 18:44:33,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:33,088 INFO L225 Difference]: With dead ends: 32 [2022-04-27 18:44:33,088 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 18:44:33,089 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 18:44:33,091 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 18:44:33,092 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 18:44:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 18:44:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 18:44:33,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:33,121 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 18:44:33,122 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 18:44:33,122 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 18:44:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,133 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 18:44:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 18:44:33,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:33,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:33,135 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 18:44:33,136 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 18:44:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,141 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 18:44:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 18:44:33,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:33,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:33,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:33,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:33,143 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 18:44:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 18:44:33,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-04-27 18:44:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:33,148 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 18:44:33,148 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 18:44:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 18:44:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 18:44:33,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:33,150 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 18:44:33,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 18:44:33,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1010552682, now seen corresponding path program 1 times [2022-04-27 18:44:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:33,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415709326] [2022-04-27 18:44:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:33,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:44:33,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553661215] [2022-04-27 18:44:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:33,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:33,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:33,196 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 18:44:33,197 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 18:44:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 18:44:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:44:33,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-27 18:44:33,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {172#true} is VALID [2022-04-27 18:44:33,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {172#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:44:33,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {202#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:44:33,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:44:33,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#(not (= |assume_abort_if_not_#in~cond| 0))} {172#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-27 18:44:33,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-27 18:44:33,617 INFO L272 TraceCheckUtils]: 12: Hoare triple {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-27 18:44:33,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,618 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {172#true} {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-27 18:44:33,619 INFO L272 TraceCheckUtils]: 17: Hoare triple {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:44:33,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {198#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {202#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:44:33,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {202#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:44:33,621 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {202#(not (= |assume_abort_if_not_#in~cond| 0))} {209#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {243#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 18:44:33,621 INFO L272 TraceCheckUtils]: 22: Hoare triple {243#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-27 18:44:33,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,622 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {172#true} {243#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {243#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 18:44:33,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {262#(and (= main_~z~0 main_~y~0) (<= main_~z~0 1) (= main_~x~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 18:44:33,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {262#(and (= main_~z~0 main_~y~0) (<= main_~z~0 1) (= main_~x~0 1) (<= 1 main_~z~0))} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(and (= main_~z~0 main_~y~0) (<= main_~z~0 1) (= main_~x~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 18:44:33,624 INFO L272 TraceCheckUtils]: 29: Hoare triple {262#(and (= main_~z~0 main_~y~0) (<= main_~z~0 1) (= main_~x~0 1) (<= 1 main_~z~0))} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:33,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {269#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:33,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {273#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 18:44:33,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {173#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 18:44:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 18:44:33,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:44:33,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {173#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 18:44:33,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {273#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 18:44:33,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {269#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:33,903 INFO L272 TraceCheckUtils]: 29: Hoare triple {289#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:33,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {289#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:33,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {172#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {289#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:33,904 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {172#true} {172#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-27 18:44:33,904 INFO L272 TraceCheckUtils]: 22: Hoare triple {172#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,904 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {172#true} {172#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L272 TraceCheckUtils]: 17: Hoare triple {172#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {172#true} {172#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {172#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {172#true} {172#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-27 18:44:33,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {172#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-27 18:44:33,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {172#true} is VALID [2022-04-27 18:44:33,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-27 18:44:33,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 18:44:33,907 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 18:44:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:33,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415709326] [2022-04-27 18:44:33,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:44:33,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553661215] [2022-04-27 18:44:33,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553661215] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 18:44:33,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 18:44:33,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 18:44:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671537219] [2022-04-27 18:44:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:44:33,909 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 18:44:33,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:33,910 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 18:44:33,924 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 18:44:33,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 18:44:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 18:44:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 18:44:33,925 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 18:44:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:34,017 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 18:44:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 18:44:34,017 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 18:44:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:34,017 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 18:44:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 18:44:34,019 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 18:44:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 18:44:34,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 18:44:34,045 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 18:44:34,046 INFO L225 Difference]: With dead ends: 31 [2022-04-27 18:44:34,046 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 18:44:34,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 18:44:34,047 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:34,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 18:44:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 18:44:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 18:44:34,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:34,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 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 18:44:34,050 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 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 18:44:34,050 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 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 18:44:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:34,052 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 18:44:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-27 18:44:34,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:34,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:34,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 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 29 states. [2022-04-27 18:44:34,053 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 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 29 states. [2022-04-27 18:44:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:34,055 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 18:44:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-27 18:44:34,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:34,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:34,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:34,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 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 18:44:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-27 18:44:34,057 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 33 [2022-04-27 18:44:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:34,057 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-27 18:44:34,057 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 18:44:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-27 18:44:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 18:44:34,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:34,058 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 18:44:34,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 18:44:34,266 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 18:44:34,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1070211269, now seen corresponding path program 1 times [2022-04-27 18:44:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:34,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700792617] [2022-04-27 18:44:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:34,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:44:34,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968275384] [2022-04-27 18:44:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:34,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:34,286 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 18:44:34,287 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 18:44:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:34,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 18:44:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:34,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:44:36,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {499#true} is VALID [2022-04-27 18:44:36,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {499#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {499#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {499#true} {499#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {499#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {499#true} is VALID [2022-04-27 18:44:36,826 INFO L272 TraceCheckUtils]: 12: Hoare triple {499#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {499#true} {499#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L272 TraceCheckUtils]: 17: Hoare triple {499#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {499#true} {499#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L272 TraceCheckUtils]: 22: Hoare triple {499#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {499#true} {499#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {499#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {499#true} is VALID [2022-04-27 18:44:36,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {499#true} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:36,829 INFO L272 TraceCheckUtils]: 29: Hoare triple {499#true} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {499#true} is VALID [2022-04-27 18:44:36,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {499#true} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {594#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:36,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {594#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [98] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:36,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {598#(not (= |__VERIFIER_assert_#in~cond| 0))} [102] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:36,830 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {598#(not (= |__VERIFIER_assert_#in~cond| 0))} {499#true} [109] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:36,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [93] L37-1-->L36-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:36,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [90] L36-3-->L50: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {612#(exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (and (= main_~x~0 (* v_main_~x~0_12 (+ (- 1) main_~z~0))) (= (+ (* v_main_~x~0_12 main_~z~0) 1) (+ v_main_~x~0_12 main_~y~0))))} is VALID [2022-04-27 18:44:36,832 INFO L272 TraceCheckUtils]: 36: Hoare triple {612#(exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (and (= main_~x~0 (* v_main_~x~0_12 (+ (- 1) main_~z~0))) (= (+ (* v_main_~x~0_12 main_~z~0) 1) (+ v_main_~x~0_12 main_~y~0))))} [92] L50-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:36,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {616#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:36,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {620#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {500#false} is VALID [2022-04-27 18:44:36,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {500#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {500#false} is VALID [2022-04-27 18:44:36,833 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 18:44:36,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:44:39,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {500#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {500#false} is VALID [2022-04-27 18:44:39,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {620#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {500#false} is VALID [2022-04-27 18:44:39,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {616#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:39,105 INFO L272 TraceCheckUtils]: 36: Hoare triple {636#(= (+ main_~x~0 1) main_~y~0)} [92] L50-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:39,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [90] L36-3-->L50: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {636#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 18:44:39,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [93] L37-1-->L36-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:39,107 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {598#(not (= |__VERIFIER_assert_#in~cond| 0))} {499#true} [109] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {605#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:39,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {598#(not (= |__VERIFIER_assert_#in~cond| 0))} [102] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:39,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [98] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:39,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {499#true} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 18:44:39,108 INFO L272 TraceCheckUtils]: 29: Hoare triple {499#true} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {499#true} is VALID [2022-04-27 18:44:39,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {499#true} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {499#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {499#true} is VALID [2022-04-27 18:44:39,109 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {499#true} {499#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:39,109 INFO L272 TraceCheckUtils]: 22: Hoare triple {499#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,109 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {499#true} {499#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L272 TraceCheckUtils]: 17: Hoare triple {499#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {499#true} {499#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L272 TraceCheckUtils]: 12: Hoare triple {499#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {499#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {499#true} {499#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {499#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {499#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {499#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~z~0_10 1) (<= 0 v_main_~z~0_10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 18:44:39,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {499#true} is VALID [2022-04-27 18:44:39,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {499#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {499#true} is VALID [2022-04-27 18:44:39,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 18:44:39,112 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 18:44:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:39,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700792617] [2022-04-27 18:44:39,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:44:39,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968275384] [2022-04-27 18:44:39,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968275384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 18:44:39,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 18:44:39,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 18:44:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378192869] [2022-04-27 18:44:39,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 18:44:39,114 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 18:44:39,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:39,114 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 18:44:39,139 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 18:44:39,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 18:44:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 18:44:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 18:44:39,141 INFO L87 Difference]: Start difference. First operand 29 states and 32 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 18:44:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:39,378 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 18:44:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 18:44:39,378 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 18:44:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:39,378 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 18:44:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-27 18:44:39,380 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 18:44:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-27 18:44:39,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-27 18:44:39,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:39,431 INFO L225 Difference]: With dead ends: 27 [2022-04-27 18:44:39,432 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 18:44:39,432 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 18:44:39,433 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:39,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-04-27 18:44:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 18:44:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 18:44:39,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:39,434 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 18:44:39,434 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 18:44:39,434 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 18:44:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:39,434 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 18:44:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:44:39,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:39,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:39,435 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 18:44:39,435 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 18:44:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:39,435 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 18:44:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:44:39,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:39,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:39,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:39,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:39,435 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 18:44:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 18:44:39,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-27 18:44:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:39,435 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 18:44:39,436 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 18:44:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:44:39,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:39,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 18:44:39,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 18:44:39,638 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 18:44:39,642 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 18:44:39,643 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 18:44:39,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:44:39 BasicIcfg [2022-04-27 18:44:39,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 18:44:39,646 INFO L158 Benchmark]: Toolchain (without parser) took 7627.43ms. Allocated memory was 200.3MB in the beginning and 254.8MB in the end (delta: 54.5MB). Free memory was 152.8MB in the beginning and 230.2MB in the end (delta: -77.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 18:44:39,647 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 168.7MB in the beginning and 168.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 18:44:39,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.46ms. Allocated memory is still 200.3MB. Free memory was 152.7MB in the beginning and 176.8MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 18:44:39,647 INFO L158 Benchmark]: Boogie Preprocessor took 22.93ms. Allocated memory is still 200.3MB. Free memory was 176.8MB in the beginning and 175.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 18:44:39,648 INFO L158 Benchmark]: RCFGBuilder took 231.36ms. Allocated memory is still 200.3MB. Free memory was 175.3MB in the beginning and 164.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 18:44:39,648 INFO L158 Benchmark]: IcfgTransformer took 33.03ms. Allocated memory is still 200.3MB. Free memory was 164.2MB in the beginning and 162.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 18:44:39,648 INFO L158 Benchmark]: TraceAbstraction took 7168.88ms. Allocated memory was 200.3MB in the beginning and 254.8MB in the end (delta: 54.5MB). Free memory was 162.1MB in the beginning and 230.2MB in the end (delta: -68.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 18:44:39,653 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 200.3MB. Free memory was 168.7MB in the beginning and 168.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.46ms. Allocated memory is still 200.3MB. Free memory was 152.7MB in the beginning and 176.8MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.93ms. Allocated memory is still 200.3MB. Free memory was 176.8MB in the beginning and 175.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 231.36ms. Allocated memory is still 200.3MB. Free memory was 175.3MB in the beginning and 164.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.03ms. Allocated memory is still 200.3MB. Free memory was 164.2MB in the beginning and 162.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7168.88ms. Allocated memory was 200.3MB in the beginning and 254.8MB in the end (delta: 54.5MB). Free memory was 162.1MB in the beginning and 230.2MB in the end (delta: -68.1MB). There was no memory consumed. 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 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 80 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 174 ConstructedInterpolants, 1 QuantifiedInterpolants, 356 SizeOfPredicates, 6 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 113/124 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 18:44:39,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...