/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/sqrt1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:18:21,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:18:21,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:18:21,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:18:21,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:18:21,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:18:21,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:18:21,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:18:21,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:18:21,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:18:21,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:18:21,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:18:21,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:18:21,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:18:21,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:18:21,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:18:21,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:18:21,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:18:21,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:18:21,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:18:21,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:18:21,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:18:21,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:18:21,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:18:21,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:18:21,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:18:21,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:18:21,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:18:21,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:18:21,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:18:21,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:18:21,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:18:21,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:18:21,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:18:21,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:18:21,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:18:21,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:18:21,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:18:21,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:18:21,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:18:21,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:18:21,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:18:21,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 23:18:21,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:18:21,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:18:21,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:18:21,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:18:21,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:18:21,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:18:21,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:18:21,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:18:21,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:18:21,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:18:21,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:18:21,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:18:21,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:18:21,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:18:21,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:18:21,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:18:21,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:18:21,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:18:21,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:18:21,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:18:21,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:18:21,315 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:18:21,315 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-14 23:18:21,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:18:21,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:18:21,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:18:21,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:18:21,566 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:18:21,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-14 23:18:21,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e809e48fa/728acff426f64777bc81667febaf6a77/FLAG17df55be0 [2022-04-14 23:18:22,046 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:18:22,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-14 23:18:22,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e809e48fa/728acff426f64777bc81667febaf6a77/FLAG17df55be0 [2022-04-14 23:18:22,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e809e48fa/728acff426f64777bc81667febaf6a77 [2022-04-14 23:18:22,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:18:22,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:18:22,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:18:22,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:18:22,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:18:22,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e15d517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22, skipping insertion in model container [2022-04-14 23:18:22,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:18:22,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:18:22,588 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/sqrt1-ll_valuebound10.c[520,533] [2022-04-14 23:18:22,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:18:22,623 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:18:22,637 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/sqrt1-ll_valuebound10.c[520,533] [2022-04-14 23:18:22,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:18:22,659 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:18:22,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22 WrapperNode [2022-04-14 23:18:22,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:18:22,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:18:22,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:18:22,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:18:22,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:18:22,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:18:22,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:18:22,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:18:22,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (1/1) ... [2022-04-14 23:18:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:18:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:18:22,724 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-14 23:18:22,736 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-14 23:18:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:18:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:18:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:18:22,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 23:18:22,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 23:18:22,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:18:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:18:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:18:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:18:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:18:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:18:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 23:18:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 23:18:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:18:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:18:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:18:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:18:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:18:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:18:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:18:22,830 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:18:22,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:18:23,012 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:18:23,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:18:23,018 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:18:23,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:18:23 BoogieIcfgContainer [2022-04-14 23:18:23,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:18:23,033 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:18:23,033 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:18:23,034 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:18:23,036 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:18:23" (1/1) ... [2022-04-14 23:18:23,038 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:18:23,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:18:23 BasicIcfg [2022-04-14 23:18:23,079 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:18:23,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:18:23,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:18:23,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:18:23,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:18:22" (1/4) ... [2022-04-14 23:18:23,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306e889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:18:23, skipping insertion in model container [2022-04-14 23:18:23,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:18:22" (2/4) ... [2022-04-14 23:18:23,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306e889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:18:23, skipping insertion in model container [2022-04-14 23:18:23,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:18:23" (3/4) ... [2022-04-14 23:18:23,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306e889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:18:23, skipping insertion in model container [2022-04-14 23:18:23,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:18:23" (4/4) ... [2022-04-14 23:18:23,089 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound10.cJordan [2022-04-14 23:18:23,095 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:18:23,096 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:18:23,147 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:18:23,155 INFO L340 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 [2022-04-14 23:18:23,156 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:18:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 23:18:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 23:18:23,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:18:23,189 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:18:23,190 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:18:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:18:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash -179702132, now seen corresponding path program 1 times [2022-04-14 23:18:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:18:23,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625123934] [2022-04-14 23:18:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:18:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:18:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:23,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {34#true} is VALID [2022-04-14 23:18:23,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 23:18:23,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 23:18:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 23:18:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:23,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L9: 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] {34#true} is VALID [2022-04-14 23:18:23,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [84] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 23:18:23,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 23:18:23,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-14 23:18:23,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:18:23,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {34#true} is VALID [2022-04-14 23:18:23,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 23:18:23,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 23:18:23,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-14 23:18:23,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {34#true} is VALID [2022-04-14 23:18:23,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-14 23:18:23,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L9: 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] {34#true} is VALID [2022-04-14 23:18:23,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [84] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 23:18:23,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 23:18:23,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-14 23:18:23,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {35#false} is VALID [2022-04-14 23:18:23,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} [81] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 23:18:23,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} [86] L30-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_11 (+ (* 2 v_main_~a~0_11) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {35#false} is VALID [2022-04-14 23:18:23,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [90] __VERIFIER_assertENTRY-->L12: 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] {35#false} is VALID [2022-04-14 23:18:23,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [93] L12-->L13: 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[] {35#false} is VALID [2022-04-14 23:18:23,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-14 23:18:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:18:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:18:23,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625123934] [2022-04-14 23:18:23,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625123934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:18:23,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:18:23,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 23:18:23,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734050493] [2022-04-14 23:18:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:18:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 23:18:23,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:18:23,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:23,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:23,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 23:18:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:18:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 23:18:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 23:18:23,511 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:23,660 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-14 23:18:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 23:18:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 23:18:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:18:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-14 23:18:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-14 23:18:23,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-14 23:18:23,747 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-14 23:18:23,756 INFO L225 Difference]: With dead ends: 31 [2022-04-14 23:18:23,756 INFO L226 Difference]: Without dead ends: 26 [2022-04-14 23:18:23,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-14 23:18:23,761 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:18:23,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:18:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-14 23:18:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-14 23:18:23,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:18:23,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:18:23,793 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:18:23,794 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:18:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:23,801 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-14 23:18:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-14 23:18:23,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:23,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:23,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-14 23:18:23,803 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-14 23:18:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:23,809 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-14 23:18:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-14 23:18:23,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:23,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:23,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:18:23,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:18:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:18:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-14 23:18:23,826 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-14 23:18:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:18:23,826 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-14 23:18:23,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-14 23:18:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 23:18:23,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:18:23,828 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:18:23,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:18:23,828 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:18:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:18:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1985279762, now seen corresponding path program 1 times [2022-04-14 23:18:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:18:23,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106877677] [2022-04-14 23:18:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:18:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:23,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:18:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:23,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {155#true} is VALID [2022-04-14 23:18:23,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:23,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155#true} {155#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 23:18:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:24,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#true} [80] assume_abort_if_notENTRY-->L9: 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] {155#true} is VALID [2022-04-14 23:18:24,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} [85] L9-->L9-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[] {155#true} is VALID [2022-04-14 23:18:24,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:24,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {155#true} is VALID [2022-04-14 23:18:24,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:18:24,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {155#true} is VALID [2022-04-14 23:18:24,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:24,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:24,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {155#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:24,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {155#true} is VALID [2022-04-14 23:18:24,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {155#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {155#true} is VALID [2022-04-14 23:18:24,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#true} [80] assume_abort_if_notENTRY-->L9: 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] {155#true} is VALID [2022-04-14 23:18:24,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#true} [85] L9-->L9-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[] {155#true} is VALID [2022-04-14 23:18:24,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-14 23:18:24,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {155#true} {155#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {155#true} is VALID [2022-04-14 23:18:24,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-14 23:18:24,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-14 23:18:24,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 23:18:24,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {165#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L12: 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] {166#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 23:18:24,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= __VERIFIER_assert_~cond 0))} [93] L12-->L13: 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[] {156#false} is VALID [2022-04-14 23:18:24,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {156#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-14 23:18:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:18:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:18:24,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106877677] [2022-04-14 23:18:24,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106877677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:18:24,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:18:24,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 23:18:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251240381] [2022-04-14 23:18:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:18:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 23:18:24,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:18:24,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:24,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:24,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 23:18:24,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:18:24,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 23:18:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 23:18:24,053 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:24,504 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 23:18:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 23:18:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 23:18:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:18:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-14 23:18:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-14 23:18:24,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-14 23:18:24,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:24,587 INFO L225 Difference]: With dead ends: 38 [2022-04-14 23:18:24,587 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 23:18:24,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 23:18:24,592 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 23:18:24,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 23:18:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 23:18:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-14 23:18:24,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:18:24,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 23:18:24,602 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 23:18:24,602 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 23:18:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:24,605 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 23:18:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-14 23:18:24,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:24,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:24,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-14 23:18:24,607 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-14 23:18:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:24,610 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 23:18:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-14 23:18:24,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:24,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:24,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:18:24,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:18:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 23:18:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-14 23:18:24,614 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-14 23:18:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:18:24,614 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-14 23:18:24,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 23:18:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-14 23:18:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:18:24,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:18:24,615 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:18:24,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:18:24,616 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:18:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:18:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1146988413, now seen corresponding path program 1 times [2022-04-14 23:18:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:18:24,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76674429] [2022-04-14 23:18:24,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:18:24,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:18:24,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100270961] [2022-04-14 23:18:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:18:24,637 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-14 23:18:24,643 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-14 23:18:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:24,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 23:18:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:24,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:18:24,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {328#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-14 23:18:24,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {328#true} is VALID [2022-04-14 23:18:24,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-14 23:18:24,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-14 23:18:24,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-14 23:18:24,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {328#true} is VALID [2022-04-14 23:18:24,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {328#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {328#true} is VALID [2022-04-14 23:18:24,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {328#true} [80] assume_abort_if_notENTRY-->L9: 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] {328#true} is VALID [2022-04-14 23:18:24,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#true} [85] L9-->L9-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[] {328#true} is VALID [2022-04-14 23:18:24,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-14 23:18:24,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {328#true} {328#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {328#true} is VALID [2022-04-14 23:18:24,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {366#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 23:18:24,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#(and (= main_~a~0 0) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 23:18:24,919 INFO L272 TraceCheckUtils]: 13: Hoare triple {366#(and (= main_~a~0 0) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {328#true} is VALID [2022-04-14 23:18:24,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#true} [90] __VERIFIER_assertENTRY-->L12: 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] {328#true} is VALID [2022-04-14 23:18:24,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#true} [94] L12-->L12-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[] {328#true} is VALID [2022-04-14 23:18:24,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-14 23:18:24,921 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {328#true} {366#(and (= main_~a~0 0) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {366#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 23:18:24,922 INFO L272 TraceCheckUtils]: 18: Hoare triple {366#(and (= main_~a~0 0) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:18:24,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {388#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: 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] {392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:18:24,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {392#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: 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[] {329#false} is VALID [2022-04-14 23:18:24,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {329#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-14 23:18:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:18:24,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 23:18:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:18:24,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76674429] [2022-04-14 23:18:24,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:18:24,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100270961] [2022-04-14 23:18:24,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100270961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:18:24,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:18:24,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 23:18:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488353810] [2022-04-14 23:18:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:18:24,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 23:18:24,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:18:24,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:18:24,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:24,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 23:18:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:18:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 23:18:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:18:24,944 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:18:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:25,099 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-14 23:18:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 23:18:25,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 23:18:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:18:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:18:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-14 23:18:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:18:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-14 23:18:25,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-14 23:18:25,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:25,144 INFO L225 Difference]: With dead ends: 42 [2022-04-14 23:18:25,144 INFO L226 Difference]: Without dead ends: 42 [2022-04-14 23:18:25,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 23:18:25,145 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:18:25,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:18:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-14 23:18:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-14 23:18:25,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:18:25,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 23:18:25,150 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 23:18:25,151 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 23:18:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:25,153 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-14 23:18:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-14 23:18:25,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:25,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:25,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-14 23:18:25,155 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-14 23:18:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:25,157 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-14 23:18:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-14 23:18:25,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:25,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:25,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:18:25,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:18:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 23:18:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-14 23:18:25,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-14 23:18:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:18:25,161 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-14 23:18:25,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:18:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-14 23:18:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:18:25,162 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:18:25,162 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:18:25,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 23:18:25,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:25,387 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:18:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:18:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash -88951989, now seen corresponding path program 1 times [2022-04-14 23:18:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:18:25,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826582777] [2022-04-14 23:18:25,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:18:25,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:18:25,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049005660] [2022-04-14 23:18:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:25,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:18:25,405 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-14 23:18:25,406 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-14 23:18:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:25,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 23:18:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:25,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:18:25,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {567#true} is VALID [2022-04-14 23:18:25,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {567#true} is VALID [2022-04-14 23:18:25,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {567#true} is VALID [2022-04-14 23:18:25,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} [80] assume_abort_if_notENTRY-->L9: 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] {567#true} is VALID [2022-04-14 23:18:25,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} [85] L9-->L9-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[] {567#true} is VALID [2022-04-14 23:18:25,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {567#true} is VALID [2022-04-14 23:18:25,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:25,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:25,577 INFO L272 TraceCheckUtils]: 13: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {567#true} is VALID [2022-04-14 23:18:25,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} [90] __VERIFIER_assertENTRY-->L12: 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] {567#true} is VALID [2022-04-14 23:18:25,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} [94] L12-->L12-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[] {567#true} is VALID [2022-04-14 23:18:25,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,579 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {567#true} {605#(and (= main_~t~0 1) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:25,579 INFO L272 TraceCheckUtils]: 18: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {567#true} is VALID [2022-04-14 23:18:25,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#true} [90] __VERIFIER_assertENTRY-->L12: 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] {567#true} is VALID [2022-04-14 23:18:25,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} [94] L12-->L12-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[] {567#true} is VALID [2022-04-14 23:18:25,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-14 23:18:25,580 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {567#true} {605#(and (= main_~t~0 1) (= main_~s~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:25,581 INFO L272 TraceCheckUtils]: 23: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:18:25,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {642#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: 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] {646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:18:25,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {646#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: 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[] {568#false} is VALID [2022-04-14 23:18:25,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {568#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-14 23:18:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 23:18:25,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 23:18:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:18:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826582777] [2022-04-14 23:18:25,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:18:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049005660] [2022-04-14 23:18:25,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049005660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:18:25,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:18:25,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 23:18:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409684655] [2022-04-14 23:18:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:18:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 23:18:25,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:18:25,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:18:25,601 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-14 23:18:25,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 23:18:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:18:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 23:18:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:18:25,603 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:18:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:25,741 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-14 23:18:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 23:18:25,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 23:18:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:18:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:18:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-14 23:18:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:18:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-14 23:18:25,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-14 23:18:25,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:25,796 INFO L225 Difference]: With dead ends: 46 [2022-04-14 23:18:25,796 INFO L226 Difference]: Without dead ends: 43 [2022-04-14 23:18:25,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 23:18:25,799 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:18:25,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:18:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-14 23:18:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-14 23:18:25,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:18:25,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:25,823 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:25,824 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:25,826 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-14 23:18:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-14 23:18:25,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:25,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:25,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-14 23:18:25,827 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-14 23:18:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:25,829 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-14 23:18:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-14 23:18:25,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:25,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:25,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:18:25,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:18:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-14 23:18:25,831 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-14 23:18:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:18:25,832 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-14 23:18:25,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:18:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-14 23:18:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 23:18:25,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:18:25,833 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:18:25,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 23:18:26,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-14 23:18:26,052 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:18:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:18:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 196845204, now seen corresponding path program 1 times [2022-04-14 23:18:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:18:26,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519103571] [2022-04-14 23:18:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:18:26,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:18:26,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170194730] [2022-04-14 23:18:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:18:26,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 23:18:26,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 23:18:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:26,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 23:18:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:26,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:18:26,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {829#true} is VALID [2022-04-14 23:18:26,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-14 23:18:26,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {829#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-14 23:18:26,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {829#true} [80] assume_abort_if_notENTRY-->L9: 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] {829#true} is VALID [2022-04-14 23:18:26,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#true} [85] L9-->L9-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[] {829#true} is VALID [2022-04-14 23:18:26,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {829#true} {829#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-14 23:18:26,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 23:18:26,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 23:18:26,354 INFO L272 TraceCheckUtils]: 13: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {829#true} is VALID [2022-04-14 23:18:26,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: 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] {829#true} is VALID [2022-04-14 23:18:26,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {829#true} [94] L12-->L12-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[] {829#true} is VALID [2022-04-14 23:18:26,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,356 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {829#true} {867#(and (= main_~a~0 0) (= main_~t~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 23:18:26,356 INFO L272 TraceCheckUtils]: 18: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-14 23:18:26,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: 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] {829#true} is VALID [2022-04-14 23:18:26,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#true} [94] L12-->L12-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[] {829#true} is VALID [2022-04-14 23:18:26,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,357 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {829#true} {867#(and (= main_~a~0 0) (= main_~t~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 23:18:26,357 INFO L272 TraceCheckUtils]: 23: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {829#true} is VALID [2022-04-14 23:18:26,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: 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] {829#true} is VALID [2022-04-14 23:18:26,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {829#true} [94] L12-->L12-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[] {829#true} is VALID [2022-04-14 23:18:26,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,358 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {829#true} {867#(and (= main_~a~0 0) (= main_~t~0 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 23:18:26,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 23:18:26,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 23:18:26,360 INFO L272 TraceCheckUtils]: 30: Hoare triple {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:18:26,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {926#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: 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] {930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:18:26,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {930#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: 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[] {830#false} is VALID [2022-04-14 23:18:26,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {830#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {830#false} is VALID [2022-04-14 23:18:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 23:18:26,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 23:18:26,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {830#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {830#false} is VALID [2022-04-14 23:18:26,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {930#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: 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[] {830#false} is VALID [2022-04-14 23:18:26,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {926#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: 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] {930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:18:26,552 INFO L272 TraceCheckUtils]: 30: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:18:26,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,554 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {829#true} {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {829#true} [94] L12-->L12-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[] {829#true} is VALID [2022-04-14 23:18:26,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: 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] {829#true} is VALID [2022-04-14 23:18:26,554 INFO L272 TraceCheckUtils]: 23: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {829#true} is VALID [2022-04-14 23:18:26,558 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {829#true} {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#true} [94] L12-->L12-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[] {829#true} is VALID [2022-04-14 23:18:26,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: 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] {829#true} is VALID [2022-04-14 23:18:26,559 INFO L272 TraceCheckUtils]: 18: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-14 23:18:26,559 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {829#true} {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {829#true} [94] L12-->L12-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[] {829#true} is VALID [2022-04-14 23:18:26,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: 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] {829#true} is VALID [2022-04-14 23:18:26,560 INFO L272 TraceCheckUtils]: 13: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {829#true} is VALID [2022-04-14 23:18:26,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 23:18:26,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {829#true} {829#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-14 23:18:26,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#true} [85] L9-->L9-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[] {829#true} is VALID [2022-04-14 23:18:26,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {829#true} [80] assume_abort_if_notENTRY-->L9: 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] {829#true} is VALID [2022-04-14 23:18:26,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {829#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-14 23:18:26,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-14 23:18:26,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {829#true} is VALID [2022-04-14 23:18:26,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-14 23:18:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-14 23:18:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:18:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519103571] [2022-04-14 23:18:26,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:18:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170194730] [2022-04-14 23:18:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170194730] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 23:18:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 23:18:26,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 23:18:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603345097] [2022-04-14 23:18:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:18:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 23:18:26,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:18:26,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 23:18:26,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:26,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 23:18:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:18:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 23:18:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 23:18:26,608 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 23:18:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:26,763 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-14 23:18:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 23:18:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 23:18:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:18:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 23:18:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-14 23:18:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 23:18:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-14 23:18:26,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-14 23:18:26,802 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-14 23:18:26,803 INFO L225 Difference]: With dead ends: 47 [2022-04-14 23:18:26,803 INFO L226 Difference]: Without dead ends: 47 [2022-04-14 23:18:26,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 23:18:26,804 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:18:26,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:18:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-14 23:18:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-14 23:18:26,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:18:26,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:26,808 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:26,808 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:26,810 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-14 23:18:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-14 23:18:26,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:26,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:26,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-14 23:18:26,811 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-14 23:18:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:26,813 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-14 23:18:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-14 23:18:26,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:26,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:26,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:18:26,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:18:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 23:18:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-14 23:18:26,815 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-14 23:18:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:18:26,816 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-14 23:18:26,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 23:18:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-14 23:18:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 23:18:26,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:18:26,817 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:18:26,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 23:18:27,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:27,030 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:18:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:18:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -374953577, now seen corresponding path program 2 times [2022-04-14 23:18:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:18:27,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550686994] [2022-04-14 23:18:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:18:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:18:27,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:18:27,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126530375] [2022-04-14 23:18:27,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 23:18:27,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:27,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:18:27,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 23:18:27,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 23:18:27,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 23:18:27,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 23:18:27,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 23:18:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:18:27,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:18:27,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {1229#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#true} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {1229#true} is VALID [2022-04-14 23:18:27,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#true} {1229#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-14 23:18:27,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#true} [80] assume_abort_if_notENTRY-->L9: 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] {1229#true} is VALID [2022-04-14 23:18:27,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#true} [85] L9-->L9-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[] {1229#true} is VALID [2022-04-14 23:18:27,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#true} {1229#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-14 23:18:27,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:27,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:27,380 INFO L272 TraceCheckUtils]: 13: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,382 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1229#true} {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:27,382 INFO L272 TraceCheckUtils]: 18: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,384 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1229#true} {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:27,385 INFO L272 TraceCheckUtils]: 23: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1229#true} is VALID [2022-04-14 23:18:27,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,388 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1229#true} {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 23:18:27,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 23:18:27,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 23:18:27,389 INFO L272 TraceCheckUtils]: 30: Hoare triple {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,392 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1229#true} {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 23:18:27,393 INFO L272 TraceCheckUtils]: 35: Hoare triple {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:18:27,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: 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] {1345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:18:27,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {1345#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: 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[] {1230#false} is VALID [2022-04-14 23:18:27,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {1230#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#false} is VALID [2022-04-14 23:18:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 23:18:27,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 23:18:27,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {1230#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#false} is VALID [2022-04-14 23:18:27,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {1345#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: 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[] {1230#false} is VALID [2022-04-14 23:18:27,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: 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] {1345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:18:27,594 INFO L272 TraceCheckUtils]: 35: Hoare triple {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:18:27,594 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1229#true} {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 23:18:27,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,595 INFO L272 TraceCheckUtils]: 30: Hoare triple {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 23:18:27,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 23:18:27,646 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1229#true} {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 23:18:27,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,646 INFO L272 TraceCheckUtils]: 23: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1229#true} is VALID [2022-04-14 23:18:27,652 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1229#true} {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 23:18:27,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,653 INFO L272 TraceCheckUtils]: 18: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,655 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1229#true} {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 23:18:27,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {1229#true} [94] L12-->L12-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[] {1229#true} is VALID [2022-04-14 23:18:27,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: 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] {1229#true} is VALID [2022-04-14 23:18:27,656 INFO L272 TraceCheckUtils]: 13: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 23:18:27,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 23:18:27,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#true} {1229#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-14 23:18:27,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#true} [85] L9-->L9-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[] {1229#true} is VALID [2022-04-14 23:18:27,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#true} [80] assume_abort_if_notENTRY-->L9: 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] {1229#true} is VALID [2022-04-14 23:18:27,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 10) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-14 23:18:27,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-14 23:18:27,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#true} {1229#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#true} [74] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {1229#true} is VALID [2022-04-14 23:18:27,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {1229#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-14 23:18:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 23:18:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:18:27,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550686994] [2022-04-14 23:18:27,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:18:27,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126530375] [2022-04-14 23:18:27,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126530375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 23:18:27,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 23:18:27,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 23:18:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285836824] [2022-04-14 23:18:27,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 23:18:27,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-14 23:18:27,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:18:27,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 23:18:27,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:27,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 23:18:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:18:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 23:18:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 23:18:27,706 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 23:18:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:28,276 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-14 23:18:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 23:18:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-14 23:18:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:18:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 23:18:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-14 23:18:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 23:18:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-14 23:18:28,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-14 23:18:28,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:18:28,352 INFO L225 Difference]: With dead ends: 53 [2022-04-14 23:18:28,352 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 23:18:28,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 23:18:28,353 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 23:18:28,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 23:18:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 23:18:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 23:18:28,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:18:28,354 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-14 23:18:28,354 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-14 23:18:28,354 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-14 23:18:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:28,354 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:18:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:18:28,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:28,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:28,354 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-14 23:18:28,354 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-14 23:18:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:18:28,355 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:18:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:18:28,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:28,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:18:28,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:18:28,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:18:28,355 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-14 23:18:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 23:18:28,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-14 23:18:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:18:28,355 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 23:18:28,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 23:18:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:18:28,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:18:28,358 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 23:18:28,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 23:18:28,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:18:28,570 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-14 23:18:28,571 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 23:18:28,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:18:28 BasicIcfg [2022-04-14 23:18:28,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 23:18:28,574 INFO L158 Benchmark]: Toolchain (without parser) took 6147.09ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 113.4MB in the beginning and 134.7MB in the end (delta: -21.3MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-14 23:18:28,574 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory was 130.0MB in the beginning and 130.0MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 23:18:28,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.96ms. Allocated memory is still 165.7MB. Free memory was 113.2MB in the beginning and 141.1MB in the end (delta: -28.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-14 23:18:28,574 INFO L158 Benchmark]: Boogie Preprocessor took 36.75ms. Allocated memory is still 165.7MB. Free memory was 141.1MB in the beginning and 139.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 23:18:28,575 INFO L158 Benchmark]: RCFGBuilder took 333.89ms. Allocated memory is still 165.7MB. Free memory was 139.7MB in the beginning and 128.6MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 23:18:28,575 INFO L158 Benchmark]: IcfgTransformer took 45.81ms. Allocated memory is still 165.7MB. Free memory was 128.6MB in the beginning and 127.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 23:18:28,575 INFO L158 Benchmark]: TraceAbstraction took 5492.80ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 126.5MB in the beginning and 134.7MB in the end (delta: -8.2MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2022-04-14 23:18:28,576 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.17ms. Allocated memory is still 165.7MB. Free memory was 130.0MB in the beginning and 130.0MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.96ms. Allocated memory is still 165.7MB. Free memory was 113.2MB in the beginning and 141.1MB in the end (delta: -28.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.75ms. Allocated memory is still 165.7MB. Free memory was 141.1MB in the beginning and 139.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 333.89ms. Allocated memory is still 165.7MB. Free memory was 139.7MB in the beginning and 128.6MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 45.81ms. Allocated memory is still 165.7MB. Free memory was 128.6MB in the beginning and 127.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5492.80ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 126.5MB in the beginning and 134.7MB in the end (delta: -8.2MB). Peak memory consumption was 26.5MB. 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: 14]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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-14 23:18:28,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...