/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:42:26,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:42:26,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:42:26,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:42:26,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:42:26,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:42:26,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:42:26,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:42:26,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:42:26,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:42:26,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:42:26,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:42:26,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:42:26,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:42:26,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:42:26,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:42:26,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:42:26,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:42:26,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:42:26,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:42:26,307 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:42:26,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:42:26,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:42:26,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:42:26,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:42:26,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:42:26,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:42:26,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:42:26,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:42:26,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:42:26,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:42:26,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:42:26,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:42:26,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:42:26,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:42:26,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:42:26,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:42:26,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:42:26,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:42:26,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:42:26,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:42:26,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:42:26,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:42:26,336 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:42:26,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:42:26,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:42:26,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:42:26,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:42:26,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:42:26,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:42:26,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:42:26,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:42:26,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:42:26,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:42:26,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:42:26,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:42:26,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:42:26,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:42:26,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:42:26,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:42:26,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:42:26,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:42:26,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:42:26,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:42:26,341 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:42:26,342 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 21:42:26,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:42:26,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:42:26,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:42:26,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:42:26,539 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:42:26,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c [2022-04-14 21:42:26,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d46f50d0/4c5eb405233d43bfa4b3453f0a5fe732/FLAGc413ad104 [2022-04-14 21:42:26,945 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:42:26,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c [2022-04-14 21:42:26,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d46f50d0/4c5eb405233d43bfa4b3453f0a5fe732/FLAGc413ad104 [2022-04-14 21:42:26,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d46f50d0/4c5eb405233d43bfa4b3453f0a5fe732 [2022-04-14 21:42:26,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:42:26,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:42:26,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:42:26,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:42:26,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:42:26,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:42:26" (1/1) ... [2022-04-14 21:42:26,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef0934f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:26, skipping insertion in model container [2022-04-14 21:42:26,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:42:26" (1/1) ... [2022-04-14 21:42:26,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:42:27,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:42:27,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c[546,559] [2022-04-14 21:42:27,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:42:27,130 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:42:27,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound10.c[546,559] [2022-04-14 21:42:27,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:42:27,151 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:42:27,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27 WrapperNode [2022-04-14 21:42:27,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:42:27,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:42:27,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:42:27,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:42:27,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:42:27,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:42:27,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:42:27,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:42:27,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:42:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:27,217 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 21:42:27,220 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 21:42:27,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:42:27,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:42:27,253 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:42:27,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:42:27,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:42:27,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:42:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:42:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:42:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:42:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:42:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 21:42:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:42:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:42:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:42:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:42:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:42:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:42:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:42:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:42:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:42:27,306 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:42:27,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:42:27,452 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:42:27,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:42:27,458 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 21:42:27,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:42:27 BoogieIcfgContainer [2022-04-14 21:42:27,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:42:27,460 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:42:27,460 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:42:27,467 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:42:27,470 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:42:27" (1/1) ... [2022-04-14 21:42:27,471 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:42:27,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:42:27 BasicIcfg [2022-04-14 21:42:27,488 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:42:27,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:42:27,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:42:27,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:42:27,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:42:26" (1/4) ... [2022-04-14 21:42:27,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d225f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:42:27, skipping insertion in model container [2022-04-14 21:42:27,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:27" (2/4) ... [2022-04-14 21:42:27,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d225f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:42:27, skipping insertion in model container [2022-04-14 21:42:27,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:42:27" (3/4) ... [2022-04-14 21:42:27,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d225f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:42:27, skipping insertion in model container [2022-04-14 21:42:27,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:42:27" (4/4) ... [2022-04-14 21:42:27,493 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound10.cJordan [2022-04-14 21:42:27,496 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:42:27,496 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:42:27,522 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:42:27,526 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 21:42:27,526 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:42:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:42:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 21:42:27,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:27,542 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:27,542 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1950279688, now seen corresponding path program 1 times [2022-04-14 21:42:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:27,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604152990] [2022-04-14 21:42:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:27,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:42:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:27,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID [2022-04-14 21:42:27,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-14 21:42:27,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-14 21:42:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:42:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:27,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 21:42:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:27,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 21:42:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:27,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 21:42:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:27,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:42:27,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID [2022-04-14 21:42:27,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-14 21:42:27,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-14 21:42:27,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-14 21:42:27,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {35#true} is VALID [2022-04-14 21:42:27,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-14 21:42:27,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {36#false} is VALID [2022-04-14 21:42:27,695 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-14 21:42:27,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,696 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,696 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-14 21:42:27,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,698 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,698 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-14 21:42:27,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-14 21:42:27,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,699 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-14 21:42:27,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {36#false} is VALID [2022-04-14 21:42:27,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,700 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {36#false} is VALID [2022-04-14 21:42:27,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {36#false} is VALID [2022-04-14 21:42:27,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-14 21:42:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:42:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:42:27,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604152990] [2022-04-14 21:42:27,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604152990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:42:27,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:42:27,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 21:42:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847528039] [2022-04-14 21:42:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:42:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 21:42:27,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:42:27,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:42:27,737 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 21:42:27,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 21:42:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:42:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 21:42:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:42:27,753 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:42:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:27,825 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-14 21:42:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 21:42:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 21:42:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:42:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:42:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-14 21:42:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:42:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-14 21:42:27,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-14 21:42:27,873 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 21:42:27,878 INFO L225 Difference]: With dead ends: 32 [2022-04-14 21:42:27,878 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 21:42:27,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:42:27,881 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:42:27,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:42:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 21:42:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 21:42:27,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:42:27,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:42:27,900 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:42:27,901 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:42:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:27,904 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 21:42:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 21:42:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:27,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:27,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-14 21:42:27,905 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-14 21:42:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:27,907 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 21:42:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 21:42:27,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:27,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:27,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:42:27,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:42:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:42:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-14 21:42:27,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-04-14 21:42:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:42:27,911 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-14 21:42:27,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:42:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 21:42:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 21:42:27,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:27,912 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:27,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 21:42:27,912 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1010552682, now seen corresponding path program 1 times [2022-04-14 21:42:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:27,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592628435] [2022-04-14 21:42:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:27,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:42:27,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296808573] [2022-04-14 21:42:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:27,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:27,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:27,943 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 21:42:27,963 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 21:42:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:28,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:42:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:28,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:42:28,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-14 21:42:28,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {172#true} is VALID [2022-04-14 21:42:28,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {172#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {172#true} {172#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L272 TraceCheckUtils]: 12: Hoare triple {172#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {172#true} {172#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L272 TraceCheckUtils]: 17: Hoare triple {172#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,141 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {172#true} {172#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,141 INFO L272 TraceCheckUtils]: 22: Hoare triple {172#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {172#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {172#true} is VALID [2022-04-14 21:42:28,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {172#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {172#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-14 21:42:28,141 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {172#true} {172#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {172#true} is VALID [2022-04-14 21:42:28,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {172#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {258#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-14 21:42:28,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {258#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-14 21:42:28,143 INFO L272 TraceCheckUtils]: 29: Hoare triple {258#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:42:28,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:42:28,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-14 21:42:28,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {173#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-14 21:42:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:42:28,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:42:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:42:28,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592628435] [2022-04-14 21:42:28,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:42:28,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296808573] [2022-04-14 21:42:28,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296808573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:42:28,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:42:28,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:42:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007904633] [2022-04-14 21:42:28,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:42:28,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-14 21:42:28,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:42:28,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:42:28,163 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 21:42:28,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:42:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:42:28,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:42:28,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:42:28,164 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:42:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:28,267 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-14 21:42:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:42:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-14 21:42:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:42:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:42:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 21:42:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:42:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 21:42:28,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-14 21:42:28,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:28,329 INFO L225 Difference]: With dead ends: 35 [2022-04-14 21:42:28,329 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 21:42:28,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:42:28,330 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:42:28,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:42:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 21:42:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-14 21:42:28,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:42:28,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 21:42:28,334 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 21:42:28,334 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 21:42:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:28,336 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-14 21:42:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-14 21:42:28,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:28,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:28,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-14 21:42:28,337 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-14 21:42:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:28,338 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-14 21:42:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-14 21:42:28,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:28,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:28,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:42:28,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:42:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 21:42:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-14 21:42:28,340 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2022-04-14 21:42:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:42:28,340 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-14 21:42:28,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:42:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-14 21:42:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 21:42:28,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:28,341 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:28,392 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 21:42:28,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:28,573 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1070211269, now seen corresponding path program 1 times [2022-04-14 21:42:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:28,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821973424] [2022-04-14 21:42:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:28,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:42:28,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467128971] [2022-04-14 21:42:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:28,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:28,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:28,632 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 21:42:28,634 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 21:42:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:28,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 21:42:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:28,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:42:31,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {415#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {415#true} is VALID [2022-04-14 21:42:31,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {415#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {415#true} is VALID [2022-04-14 21:42:31,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {415#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:31,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {415#true} {415#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {415#true} is VALID [2022-04-14 21:42:31,135 INFO L272 TraceCheckUtils]: 12: Hoare triple {415#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:31,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,135 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {415#true} {415#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L272 TraceCheckUtils]: 17: Hoare triple {415#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {415#true} {415#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L272 TraceCheckUtils]: 22: Hoare triple {415#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:31,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,137 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {415#true} {415#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:31,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {415#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {415#true} is VALID [2022-04-14 21:42:31,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {415#true} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:31,137 INFO L272 TraceCheckUtils]: 29: Hoare triple {415#true} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {415#true} is VALID [2022-04-14 21:42:31,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {415#true} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {510#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:42:31,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {510#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [98] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {514#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:42:31,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {514#(not (= |__VERIFIER_assert_#in~cond| 0))} [102] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {514#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:42:31,158 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {514#(not (= |__VERIFIER_assert_#in~cond| 0))} {415#true} [109] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 21:42:31,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [93] L37-1-->L36-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 21:42:31,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [90] L36-3-->L50: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {528#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-14 21:42:31,162 INFO L272 TraceCheckUtils]: 36: Hoare triple {528#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} [92] L50-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:42:31,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:42:31,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {416#false} is VALID [2022-04-14 21:42:31,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {416#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#false} is VALID [2022-04-14 21:42:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:42:31,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:42:35,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {416#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#false} is VALID [2022-04-14 21:42:35,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {416#false} is VALID [2022-04-14 21:42:35,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:42:35,602 INFO L272 TraceCheckUtils]: 36: Hoare triple {552#(= (+ main_~x~0 1) main_~y~0)} [92] L50-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:42:35,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [90] L36-3-->L50: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {552#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-14 21:42:35,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [93] L37-1-->L36-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 21:42:35,617 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {514#(not (= |__VERIFIER_assert_#in~cond| 0))} {415#true} [109] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {521#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 21:42:35,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {514#(not (= |__VERIFIER_assert_#in~cond| 0))} [102] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {514#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:42:35,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {571#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [98] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {514#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:42:35,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {415#true} [95] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {571#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 21:42:35,618 INFO L272 TraceCheckUtils]: 29: Hoare triple {415#true} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {415#true} is VALID [2022-04-14 21:42:35,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {415#true} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {415#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {415#true} is VALID [2022-04-14 21:42:35,619 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {415#true} {415#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:35,620 INFO L272 TraceCheckUtils]: 22: Hoare triple {415#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,620 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {415#true} {415#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:35,621 INFO L272 TraceCheckUtils]: 17: Hoare triple {415#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,621 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {415#true} {415#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:35,622 INFO L272 TraceCheckUtils]: 12: Hoare triple {415#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~k~0_7 10) (<= 0 v_main_~k~0_7)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {415#true} is VALID [2022-04-14 21:42:35,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {415#true} {415#true} [104] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {415#true} [82] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#true} [79] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {415#true} is VALID [2022-04-14 21:42:35,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {415#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 10)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {415#true} is VALID [2022-04-14 21:42:35,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#true} [75] mainENTRY-->L26: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {415#true} is VALID [2022-04-14 21:42:35,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {415#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {415#true} is VALID [2022-04-14 21:42:35,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {415#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-04-14 21:42:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:42:35,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:42:35,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821973424] [2022-04-14 21:42:35,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:42:35,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467128971] [2022-04-14 21:42:35,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467128971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:42:35,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:42:35,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 21:42:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069070108] [2022-04-14 21:42:35,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:42:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-14 21:42:35,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:42:35,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 21:42:35,672 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 21:42:35,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 21:42:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:42:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 21:42:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 21:42:35,674 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 21:42:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:35,898 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-14 21:42:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 21:42:35,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-14 21:42:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:42:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 21:42:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-14 21:42:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 21:42:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-14 21:42:35,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-14 21:42:35,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:35,952 INFO L225 Difference]: With dead ends: 31 [2022-04-14 21:42:35,952 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 21:42:35,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-14 21:42:35,953 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:42:35,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-04-14 21:42:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 21:42:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 21:42:35,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:42:35,955 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 21:42:35,955 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 21:42:35,955 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 21:42:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:35,955 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 21:42:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:42:35,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:35,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:35,955 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 21:42:35,955 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 21:42:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:35,955 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 21:42:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:42:35,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:35,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:35,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:42:35,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:42:35,956 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 21:42:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 21:42:35,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-14 21:42:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:42:35,956 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 21:42:35,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 21:42:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:42:35,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:35,958 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 21:42:35,993 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 21:42:36,159 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,SelfDestructingSolverStorable2 [2022-04-14 21:42:36,162 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 21:42:36,166 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 21:42:36,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:42:36 BasicIcfg [2022-04-14 21:42:36,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 21:42:36,169 INFO L158 Benchmark]: Toolchain (without parser) took 9186.45ms. Allocated memory was 218.1MB in the beginning and 286.3MB in the end (delta: 68.2MB). Free memory was 191.7MB in the beginning and 146.2MB in the end (delta: 45.4MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2022-04-14 21:42:36,169 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 178.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 21:42:36,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.79ms. Allocated memory was 218.1MB in the beginning and 286.3MB in the end (delta: 68.2MB). Free memory was 191.4MB in the beginning and 256.5MB in the end (delta: -65.2MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-14 21:42:36,170 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 286.3MB. Free memory was 256.5MB in the beginning and 255.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 21:42:36,170 INFO L158 Benchmark]: RCFGBuilder took 271.25ms. Allocated memory is still 286.3MB. Free memory was 255.1MB in the beginning and 243.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 21:42:36,170 INFO L158 Benchmark]: IcfgTransformer took 27.95ms. Allocated memory is still 286.3MB. Free memory was 243.6MB in the beginning and 241.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 21:42:36,171 INFO L158 Benchmark]: TraceAbstraction took 8679.31ms. Allocated memory is still 286.3MB. Free memory was 241.5MB in the beginning and 146.2MB in the end (delta: 95.3MB). Peak memory consumption was 96.0MB. Max. memory is 8.0GB. [2022-04-14 21:42:36,177 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.10ms. Allocated memory is still 218.1MB. Free memory is still 178.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.79ms. Allocated memory was 218.1MB in the beginning and 286.3MB in the end (delta: 68.2MB). Free memory was 191.4MB in the beginning and 256.5MB in the end (delta: -65.2MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 286.3MB. Free memory was 256.5MB in the beginning and 255.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.25ms. Allocated memory is still 286.3MB. Free memory was 255.1MB in the beginning and 243.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 27.95ms. Allocated memory is still 286.3MB. Free memory was 243.6MB in the beginning and 241.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8679.31ms. Allocated memory is still 286.3MB. Free memory was 241.5MB in the beginning and 146.2MB in the end (delta: 95.3MB). Peak memory consumption was 96.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 81 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 1 QuantifiedInterpolants, 246 SizeOfPredicates, 4 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 21:42:36,204 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...