/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/prod4br-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 22:46:48,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 22:46:48,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 22:46:48,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 22:46:48,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 22:46:48,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 22:46:48,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 22:46:48,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 22:46:48,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 22:46:48,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 22:46:48,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 22:46:48,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 22:46:48,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 22:46:48,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 22:46:48,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 22:46:48,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 22:46:48,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 22:46:48,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 22:46:48,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 22:46:48,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 22:46:48,369 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 22:46:48,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 22:46:48,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 22:46:48,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 22:46:48,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 22:46:48,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 22:46:48,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 22:46:48,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 22:46:48,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 22:46:48,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 22:46:48,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 22:46:48,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 22:46:48,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 22:46:48,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 22:46:48,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 22:46:48,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 22:46:48,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 22:46:48,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 22:46:48,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 22:46:48,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 22:46:48,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 22:46:48,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 22:46:48,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 22:46:48,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 22:46:48,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 22:46:48,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 22:46:48,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 22:46:48,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 22:46:48,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 22:46:48,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 22:46:48,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 22:46:48,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 22:46:48,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 22:46:48,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 22:46:48,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 22:46:48,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 22:46:48,397 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 22:46:48,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 22:46:48,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 22:46:48,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 22:46:48,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 22:46:48,639 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 22:46:48,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-14 22:46:48,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3c2fcb4/9be6163e15e343d0b68ad817d9d64821/FLAG9e644df83 [2022-04-14 22:46:49,012 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 22:46:49,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-14 22:46:49,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3c2fcb4/9be6163e15e343d0b68ad817d9d64821/FLAG9e644df83 [2022-04-14 22:46:49,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3c2fcb4/9be6163e15e343d0b68ad817d9d64821 [2022-04-14 22:46:49,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 22:46:49,436 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 22:46:49,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 22:46:49,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 22:46:49,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 22:46:49,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712e907b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49, skipping insertion in model container [2022-04-14 22:46:49,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 22:46:49,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 22:46:49,570 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/prod4br-ll_valuebound1.c[524,537] [2022-04-14 22:46:49,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 22:46:49,591 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 22:46:49,598 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/prod4br-ll_valuebound1.c[524,537] [2022-04-14 22:46:49,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 22:46:49,615 INFO L208 MainTranslator]: Completed translation [2022-04-14 22:46:49,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49 WrapperNode [2022-04-14 22:46:49,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 22:46:49,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 22:46:49,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 22:46:49,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 22:46:49,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 22:46:49,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 22:46:49,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 22:46:49,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 22:46:49,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (1/1) ... [2022-04-14 22:46:49,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 22:46:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:46:49,697 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 22:46:49,707 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 22:46:49,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 22:46:49,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 22:46:49,725 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 22:46:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 22:46:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 22:46:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 22:46:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 22:46:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 22:46:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 22:46:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 22:46:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 22:46:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 22:46:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 22:46:49,771 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 22:46:49,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 22:46:50,007 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 22:46:50,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 22:46:50,012 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 22:46:50,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:46:50 BoogieIcfgContainer [2022-04-14 22:46:50,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 22:46:50,014 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 22:46:50,014 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 22:46:50,025 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 22:46:50,028 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:46:50" (1/1) ... [2022-04-14 22:46:50,029 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 22:46:50,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:46:50 BasicIcfg [2022-04-14 22:46:50,072 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 22:46:50,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 22:46:50,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 22:46:50,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 22:46:50,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:46:49" (1/4) ... [2022-04-14 22:46:50,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f79406a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:46:50, skipping insertion in model container [2022-04-14 22:46:50,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:46:49" (2/4) ... [2022-04-14 22:46:50,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f79406a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:46:50, skipping insertion in model container [2022-04-14 22:46:50,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:46:50" (3/4) ... [2022-04-14 22:46:50,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f79406a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:46:50, skipping insertion in model container [2022-04-14 22:46:50,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:46:50" (4/4) ... [2022-04-14 22:46:50,081 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound1.cJordan [2022-04-14 22:46:50,084 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 22:46:50,084 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 22:46:50,120 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 22:46:50,132 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 22:46:50,132 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 22:46:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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 22:46:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 22:46:50,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:46:50,153 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:46:50,153 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:46:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:46:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 574541465, now seen corresponding path program 1 times [2022-04-14 22:46:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:46:50,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430142202] [2022-04-14 22:46:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:46:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:46:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 22:46:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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) 13) (= (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] {37#true} is VALID [2022-04-14 22:46:50,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:46:50,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:46:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 22:46:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:46:50,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:46:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 22:46:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:46:50,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:46:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 22:46:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:46:50,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:46:50,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 22:46:50,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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) 13) (= (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] {37#true} is VALID [2022-04-14 22:46:50,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:46:50,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:46:50,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:46:50,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {37#true} is VALID [2022-04-14 22:46:50,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-14 22:46:50,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:46:50,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:46:50,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {38#false} is VALID [2022-04-14 22:46:50,377 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-14 22:46:50,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:46:50,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,379 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:46:50,379 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-14 22:46:50,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:46:50,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,381 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:46:50,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {38#false} is VALID [2022-04-14 22:46:50,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} [101] L47-2-->L34-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,383 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {38#false} is VALID [2022-04-14 22:46:50,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#false} is VALID [2022-04-14 22:46:50,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:46:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 22:46:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:46:50,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430142202] [2022-04-14 22:46:50,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430142202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 22:46:50,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 22:46:50,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 22:46:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549297231] [2022-04-14 22:46:50,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 22:46:50,393 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 22:46:50,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:46:50,397 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 22:46:50,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:46:50,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 22:46:50,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:46:50,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 22:46:50,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 22:46:50,446 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 22:46:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:46:50,559 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-14 22:46:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 22:46:50,560 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 22:46:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:46:50,562 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 22:46:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-14 22:46:50,570 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 22:46:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-14 22:46:50,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-04-14 22:46:50,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:46:50,640 INFO L225 Difference]: With dead ends: 34 [2022-04-14 22:46:50,640 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 22:46:50,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 22:46:50,647 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 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 22:46:50,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 22:46:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 22:46:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 22:46:50,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:46:50,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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 22:46:50,670 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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 22:46:50,671 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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 22:46:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:46:50,677 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-14 22:46:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 22:46:50,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:46:50,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:46:50,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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 29 states. [2022-04-14 22:46:50,679 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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 29 states. [2022-04-14 22:46:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:46:50,684 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-14 22:46:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 22:46:50,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:46:50,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:46:50,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:46:50,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:46:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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 22:46:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-14 22:46:50,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-14 22:46:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:46:50,694 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-14 22:46:50,694 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 22:46:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 22:46:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 22:46:50,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:46:50,695 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:46:50,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 22:46:50,696 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:46:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:46:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2145419015, now seen corresponding path program 1 times [2022-04-14 22:46:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:46:50,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261697098] [2022-04-14 22:46:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:46:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:46:50,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:46:50,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258854015] [2022-04-14 22:46:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:46:50,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:46:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:46:50,728 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 22:46:50,729 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 22:46:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 22:46:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:50,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 22:46:51,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {178#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-14 22:46:51,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} [88] 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) 13) (= (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] {178#true} is VALID [2022-04-14 22:46:51,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-14 22:46:51,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-14 22:46:51,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {178#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-14 22:46:51,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {178#true} is VALID [2022-04-14 22:46:51,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {178#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-14 22:46:51,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:46:51,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:46:51,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:46:51,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {208#(not (= |assume_abort_if_not_#in~cond| 0))} {178#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {215#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:46:51,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {215#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {215#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:46:51,220 INFO L272 TraceCheckUtils]: 12: Hoare triple {215#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-14 22:46:51,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:46:51,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:46:51,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {208#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:46:51,224 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {208#(not (= |assume_abort_if_not_#in~cond| 0))} {215#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {234#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-14 22:46:51,224 INFO L272 TraceCheckUtils]: 17: Hoare triple {234#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-14 22:46:51,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:46:51,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:46:51,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:46:51,226 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {208#(not (= |assume_abort_if_not_#in~cond| 0))} {234#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {250#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-14 22:46:51,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {250#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {254#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:46:51,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {254#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:46:51,228 INFO L272 TraceCheckUtils]: 24: Hoare triple {254#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {261#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:46:51,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {261#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {265#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:46:51,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {265#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-14 22:46:51,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {179#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-14 22:46:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 22:46:51,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 22:46:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:46:51,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261697098] [2022-04-14 22:46:51,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 22:46:51,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258854015] [2022-04-14 22:46:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258854015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 22:46:51,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 22:46:51,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-14 22:46:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643407836] [2022-04-14 22:46:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 22:46:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-14 22:46:51,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:46:51,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 22:46:51,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:46:51,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 22:46:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:46:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 22:46:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 22:46:51,254 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 22:46:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:46:51,585 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 22:46:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 22:46:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-14 22:46:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:46:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 22:46:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 22:46:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 22:46:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 22:46:51,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-14 22:46:51,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:46:51,641 INFO L225 Difference]: With dead ends: 41 [2022-04-14 22:46:51,641 INFO L226 Difference]: Without dead ends: 41 [2022-04-14 22:46:51,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 22:46:51,642 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 22:46:51,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 128 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 22:46:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-14 22:46:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-14 22:46:51,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:46:51,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:46:51,646 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:46:51,646 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:46:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:46:51,648 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 22:46:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 22:46:51,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:46:51,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:46:51,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-14 22:46:51,649 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-14 22:46:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:46:51,650 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 22:46:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 22:46:51,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:46:51,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:46:51,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:46:51,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:46:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:46:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-04-14 22:46:51,653 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2022-04-14 22:46:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:46:51,653 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-04-14 22:46:51,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 22:46:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-14 22:46:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 22:46:51,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:46:51,654 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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 22:46:51,673 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 22:46:51,854 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 22:46:51,854 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:46:51,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:46:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash -257170002, now seen corresponding path program 1 times [2022-04-14 22:46:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:46:51,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381220046] [2022-04-14 22:46:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:46:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:46:51,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:46:51,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140366513] [2022-04-14 22:46:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:46:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:46:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:46:51,870 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 22:46:51,871 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 22:46:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:51,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 22:46:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:46:51,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 22:47:00,248 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 22:47:00,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {436#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} [88] 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) 13) (= (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] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#true} {436#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {436#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {436#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:00,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {436#true} {436#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {436#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {436#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:00,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {436#true} {436#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:00,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {436#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:00,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:47:00,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:00,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {499#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:00,773 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {499#(not (= |assume_abort_if_not_#in~cond| 0))} {436#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {506#(<= 1 main_~y~0)} is VALID [2022-04-14 22:47:00,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {506#(<= 1 main_~y~0)} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {510#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-14 22:47:00,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {510#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {510#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-14 22:47:00,774 INFO L272 TraceCheckUtils]: 24: Hoare triple {510#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {436#true} is VALID [2022-04-14 22:47:00,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {436#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:47:00,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:47:00,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {524#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:47:02,778 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {524#(not (= |__VERIFIER_assert_#in~cond| 0))} {510#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {531#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-14 22:47:02,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {531#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {535#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-14 22:47:02,780 INFO L272 TraceCheckUtils]: 30: Hoare triple {535#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:47:02,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {539#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:47:02,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {543#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {437#false} is VALID [2022-04-14 22:47:02,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {437#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {437#false} is VALID [2022-04-14 22:47:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 22:47:02,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 22:47:44,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {437#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {437#false} is VALID [2022-04-14 22:47:44,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {543#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {437#false} is VALID [2022-04-14 22:47:44,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {539#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:47:44,525 INFO L272 TraceCheckUtils]: 30: Hoare triple {559#(= main_~q~0 (* main_~y~0 main_~x~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:47:44,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {563#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {559#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-14 22:47:44,528 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {524#(not (= |__VERIFIER_assert_#in~cond| 0))} {436#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {563#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-14 22:47:44,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {524#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:47:44,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {576#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:47:44,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {436#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {576#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 22:47:44,529 INFO L272 TraceCheckUtils]: 24: Hoare triple {436#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {436#true} is VALID [2022-04-14 22:47:44,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {436#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {436#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {436#true} is VALID [2022-04-14 22:47:44,529 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {436#true} {436#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:44,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {436#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {436#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L272 TraceCheckUtils]: 17: Hoare triple {436#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {436#true} {436#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {436#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L272 TraceCheckUtils]: 12: Hoare triple {436#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {436#true} {436#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:44,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {436#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {436#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#true} {436#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} [88] 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) 13) (= (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] {436#true} is VALID [2022-04-14 22:47:44,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {436#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#true} is VALID [2022-04-14 22:47:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 22:47:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:47:44,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381220046] [2022-04-14 22:47:44,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 22:47:44,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140366513] [2022-04-14 22:47:44,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140366513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 22:47:44,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 22:47:44,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-14 22:47:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72726497] [2022-04-14 22:47:44,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 22:47:44,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-14 22:47:44,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:47:44,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:47:46,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 22:47:46,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 22:47:46,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:47:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 22:47:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-14 22:47:46,565 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:47:52,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 22:47:55,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 22:47:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:47:55,066 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-14 22:47:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 22:47:55,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-14 22:47:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:47:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:47:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-14 22:47:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:47:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-14 22:47:55,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 55 transitions. [2022-04-14 22:47:55,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:47:55,119 INFO L225 Difference]: With dead ends: 47 [2022-04-14 22:47:55,119 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 22:47:55,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-14 22:47:55,120 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-14 22:47:55,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 138 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-14 22:47:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 22:47:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-14 22:47:55,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:47:55,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:55,130 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:55,131 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:47:55,132 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-14 22:47:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-14 22:47:55,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:47:55,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:47:55,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-14 22:47:55,133 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-14 22:47:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:47:55,135 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-14 22:47:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-14 22:47:55,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:47:55,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:47:55,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:47:55,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:47:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-04-14 22:47:55,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2022-04-14 22:47:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:47:55,137 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-04-14 22:47:55,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:47:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-14 22:47:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 22:47:55,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:47:55,138 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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 22:47:55,154 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 22:47:55,338 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 22:47:55,338 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:47:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:47:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1424936990, now seen corresponding path program 1 times [2022-04-14 22:47:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:47:55,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411927050] [2022-04-14 22:47:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:47:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:47:55,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:47:55,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598433427] [2022-04-14 22:47:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:47:55,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:47:55,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:47:55,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 22:47:55,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 22:47:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:47:55,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 22:47:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:47:55,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 22:47:55,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} [88] 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) 13) (= (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] {849#true} is VALID [2022-04-14 22:47:55,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {849#true} is VALID [2022-04-14 22:47:55,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {849#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {849#true} is VALID [2022-04-14 22:47:55,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {875#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:47:55,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {875#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {879#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:55,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {879#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:55,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {879#(not (= |assume_abort_if_not_#in~cond| 0))} {849#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:47:55,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:47:55,688 INFO L272 TraceCheckUtils]: 12: Hoare triple {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {849#true} is VALID [2022-04-14 22:47:55,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {849#true} is VALID [2022-04-14 22:47:55,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {849#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,689 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {849#true} {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:47:55,689 INFO L272 TraceCheckUtils]: 17: Hoare triple {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {849#true} is VALID [2022-04-14 22:47:55,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {849#true} is VALID [2022-04-14 22:47:55,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,690 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:47:55,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {886#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-14 22:47:55,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-14 22:47:55,691 INFO L272 TraceCheckUtils]: 24: Hoare triple {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {849#true} is VALID [2022-04-14 22:47:55,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {849#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {849#true} is VALID [2022-04-14 22:47:55,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {849#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {849#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:55,692 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {849#true} {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-14 22:47:55,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {923#(and (<= main_~a~0 1) (<= 0 main_~a~0))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {945#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-14 22:47:55,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {945#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {945#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-14 22:47:55,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {945#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {945#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-14 22:47:55,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {945#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} [121] L47-->L47-2: Formula: (and (= (let ((.cse0 (mod v_main_~b~0_8 2))) (ite (and (< v_main_~b~0_8 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1) (= v_main_~b~0_7 (+ (- 1) v_main_~b~0_8)) (= v_main_~q~0_4 (+ v_main_~q~0_5 (* v_main_~a~0_8 v_main_~p~0_5))) (= (let ((.cse1 (mod v_main_~a~0_8 2))) (ite (and (< v_main_~a~0_8 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 0)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_7, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {850#false} is VALID [2022-04-14 22:47:55,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {850#false} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-14 22:47:55,705 INFO L272 TraceCheckUtils]: 34: Hoare triple {850#false} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {850#false} is VALID [2022-04-14 22:47:55,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {850#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {850#false} is VALID [2022-04-14 22:47:55,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {850#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-14 22:47:55,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {850#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-14 22:47:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 22:47:55,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 22:47:56,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {850#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-14 22:47:56,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {850#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-14 22:47:56,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {850#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {850#false} is VALID [2022-04-14 22:47:56,112 INFO L272 TraceCheckUtils]: 34: Hoare triple {850#false} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {850#false} is VALID [2022-04-14 22:47:56,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {850#false} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-14 22:47:56,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {985#(not (= (mod main_~a~0 2) 0))} [121] L47-->L47-2: Formula: (and (= (let ((.cse0 (mod v_main_~b~0_8 2))) (ite (and (< v_main_~b~0_8 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1) (= v_main_~b~0_7 (+ (- 1) v_main_~b~0_8)) (= v_main_~q~0_4 (+ v_main_~q~0_5 (* v_main_~a~0_8 v_main_~p~0_5))) (= (let ((.cse1 (mod v_main_~a~0_8 2))) (ite (and (< v_main_~a~0_8 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 0)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_7, main_~p~0=v_main_~p~0_5, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {850#false} is VALID [2022-04-14 22:47:56,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {985#(not (= (mod main_~a~0 2) 0))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {985#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-14 22:47:56,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {985#(not (= (mod main_~a~0 2) 0))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {985#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-14 22:47:56,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {985#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-14 22:47:56,116 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {849#true} {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-14 22:47:56,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {849#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {849#true} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {849#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {849#true} is VALID [2022-04-14 22:47:56,117 INFO L272 TraceCheckUtils]: 24: Hoare triple {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {849#true} is VALID [2022-04-14 22:47:56,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-14 22:47:56,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {995#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-14 22:47:56,118 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-14 22:47:56,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {849#true} is VALID [2022-04-14 22:47:56,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {849#true} is VALID [2022-04-14 22:47:56,119 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {849#true} {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-14 22:47:56,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {849#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {849#true} is VALID [2022-04-14 22:47:56,119 INFO L272 TraceCheckUtils]: 12: Hoare triple {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {849#true} is VALID [2022-04-14 22:47:56,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-14 22:47:56,120 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {879#(not (= |assume_abort_if_not_#in~cond| 0))} {849#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1017#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-14 22:47:56,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {879#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {879#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:56,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {879#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:56,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1063#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 22:47:56,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {849#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {849#true} is VALID [2022-04-14 22:47:56,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {849#true} is VALID [2022-04-14 22:47:56,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} [88] 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) 13) (= (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] {849#true} is VALID [2022-04-14 22:47:56,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-14 22:47:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 22:47:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:47:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411927050] [2022-04-14 22:47:56,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 22:47:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598433427] [2022-04-14 22:47:56,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598433427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 22:47:56,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 22:47:56,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-14 22:47:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195937421] [2022-04-14 22:47:56,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 22:47:56,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 38 [2022-04-14 22:47:56,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:47:56,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 22:47:56,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:47:56,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 22:47:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:47:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 22:47:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-14 22:47:56,169 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 22:47:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:47:56,406 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 22:47:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 22:47:56,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 38 [2022-04-14 22:47:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:47:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 22:47:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 22:47:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 22:47:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-14 22:47:56,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-14 22:47:56,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:47:56,438 INFO L225 Difference]: With dead ends: 42 [2022-04-14 22:47:56,438 INFO L226 Difference]: Without dead ends: 42 [2022-04-14 22:47:56,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-14 22:47:56,439 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 22:47:56,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 22:47:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-14 22:47:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-14 22:47:56,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:47:56,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:56,442 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:56,442 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:47:56,443 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 22:47:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-14 22:47:56,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:47:56,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:47:56,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-14 22:47:56,444 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-14 22:47:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:47:56,445 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 22:47:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-14 22:47:56,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:47:56,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:47:56,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:47:56,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:47:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 22:47:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-14 22:47:56,447 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 38 [2022-04-14 22:47:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:47:56,447 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-14 22:47:56,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 22:47:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-14 22:47:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 22:47:56,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:47:56,448 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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 22:47:56,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 22:47:56,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:47:56,663 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:47:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:47:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1396307839, now seen corresponding path program 1 times [2022-04-14 22:47:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:47:56,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926713096] [2022-04-14 22:47:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:47:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:47:56,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:47:56,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752123482] [2022-04-14 22:47:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:47:56,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:47:56,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:47:56,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 22:47:56,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 22:47:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:47:56,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-14 22:47:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:47:56,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 22:47:57,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {1261#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:47:57,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {1261#true} [88] 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) 13) (= (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] {1261#true} is VALID [2022-04-14 22:47:57,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1261#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:47:57,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1261#true} {1261#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:47:57,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {1261#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:47:57,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {1261#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1261#true} is VALID [2022-04-14 22:47:57,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {1261#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:47:57,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:47:57,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {1287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:57,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {1291#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:57,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1291#(not (= |assume_abort_if_not_#in~cond| 0))} {1261#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1298#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:47:57,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {1298#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1298#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 22:47:57,672 INFO L272 TraceCheckUtils]: 12: Hoare triple {1298#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:47:57,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {1261#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 22:47:57,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {1287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:57,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {1291#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 22:47:57,674 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1291#(not (= |assume_abort_if_not_#in~cond| 0))} {1298#(and (<= 0 main_~x~0) (<= main_~x~0 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1317#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-14 22:47:57,674 INFO L272 TraceCheckUtils]: 17: Hoare triple {1317#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:47:57,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {1261#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1261#true} is VALID [2022-04-14 22:47:57,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:47:57,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:47:57,675 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1261#true} {1317#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1317#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-14 22:47:57,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {1317#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,676 INFO L272 TraceCheckUtils]: 24: Hoare triple {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1261#true} is VALID [2022-04-14 22:47:57,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1346#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:47:57,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {1346#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:47:57,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:47:57,677 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {1336#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1360#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {1360#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1360#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {1360#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {1360#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {1360#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} [122] L47-->L47-2: Formula: (and (or (not (= (let ((.cse0 (mod v_main_~a~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~a~0_10 0)) (+ (- 2) .cse0) .cse0)) 0)) (not (= (let ((.cse1 (mod v_main_~b~0_10 2))) (ite (and (< v_main_~b~0_10 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 1))) (= v_main_~q~0_6 (+ v_main_~q~0_7 (* v_main_~p~0_6 (+ v_main_~a~0_9 v_main_~b~0_9 1)))) (= v_main_~b~0_9 (+ (- 1) v_main_~b~0_10)) (= v_main_~a~0_9 (+ (- 1) v_main_~a~0_10))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_10} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~a~0] {1370#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {1370#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-14 22:47:57,691 INFO L272 TraceCheckUtils]: 34: Hoare triple {1370#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:47:57,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:47:57,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {1381#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1262#false} is VALID [2022-04-14 22:47:57,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {1262#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1262#false} is VALID [2022-04-14 22:47:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 22:47:57,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 22:48:20,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {1262#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1262#false} is VALID [2022-04-14 22:48:20,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {1381#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1262#false} is VALID [2022-04-14 22:48:20,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:48:20,118 INFO L272 TraceCheckUtils]: 34: Hoare triple {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:48:20,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 22:48:20,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [122] L47-->L47-2: Formula: (and (or (not (= (let ((.cse0 (mod v_main_~a~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~a~0_10 0)) (+ (- 2) .cse0) .cse0)) 0)) (not (= (let ((.cse1 (mod v_main_~b~0_10 2))) (ite (and (< v_main_~b~0_10 0) (not (= .cse1 0))) (+ (- 2) .cse1) .cse1)) 1))) (= v_main_~q~0_6 (+ v_main_~q~0_7 (* v_main_~p~0_6 (+ v_main_~a~0_9 v_main_~b~0_9 1)))) (= v_main_~b~0_9 (+ (- 1) v_main_~b~0_10)) (= v_main_~a~0_9 (+ (- 1) v_main_~a~0_10))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_10} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_6, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~a~0] {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 22:48:20,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [120] L44-->L47: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_6 2))) (ite (and (< v_main_~a~0_6 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1)) (not (= (let ((.cse1 (mod v_main_~b~0_5 2))) (ite (and (< v_main_~b~0_5 0) (not (= 0 .cse1))) (+ (- 2) .cse1) .cse1)) 0))) InVars {main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 22:48:20,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 22:48:20,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {1413#(or (= main_~a~0 0) (= main_~b~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1397#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 22:48:20,125 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} {1261#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1413#(or (= main_~a~0 0) (= main_~b~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 22:48:20,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:48:20,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {1426#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [112] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 22:48:20,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1426#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 22:48:20,126 INFO L272 TraceCheckUtils]: 24: Hoare triple {1261#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1261#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {1261#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1261#true} {1261#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {1261#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L272 TraceCheckUtils]: 17: Hoare triple {1261#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1261#true} {1261#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {1261#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L272 TraceCheckUtils]: 12: Hoare triple {1261#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_8 1) (<= 0 v_main_~y~0_8)) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:48:20,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1261#true} {1261#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1261#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {1261#true} [97] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#true} [94] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {1261#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_8 1) (<= 0 v_main_~x~0_8)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1261#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {1261#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1261#true} {1261#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {1261#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1261#true} [88] 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) 13) (= (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] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {1261#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#true} is VALID [2022-04-14 22:48:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 22:48:20,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:48:20,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926713096] [2022-04-14 22:48:20,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 22:48:20,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752123482] [2022-04-14 22:48:20,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752123482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 22:48:20,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 22:48:20,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-14 22:48:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067458525] [2022-04-14 22:48:20,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 22:48:20,129 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 38 [2022-04-14 22:48:20,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:48:20,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 22:48:20,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:48:20,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-14 22:48:20,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:48:20,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-14 22:48:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-14 22:48:20,169 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 22:48:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:48:20,728 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-14 22:48:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 22:48:20,728 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 38 [2022-04-14 22:48:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:48:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 22:48:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-14 22:48:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 22:48:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-14 22:48:20,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-14 22:48:20,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:48:20,769 INFO L225 Difference]: With dead ends: 38 [2022-04-14 22:48:20,769 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 22:48:20,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-14 22:48:20,770 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 22:48:20,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 118 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 22:48:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 22:48:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 22:48:20,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:48:20,771 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 22:48:20,771 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 22:48:20,771 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 22:48:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:48:20,771 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 22:48:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 22:48:20,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:48:20,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:48:20,771 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 22:48:20,771 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 22:48:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:48:20,771 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 22:48:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 22:48:20,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:48:20,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:48:20,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:48:20,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:48:20,772 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 22:48:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 22:48:20,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-14 22:48:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:48:20,772 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 22:48:20,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 22:48:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 22:48:20,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:48:20,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 22:48:20,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 22:48:20,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:48:20,989 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-14 22:48:20,990 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 22:48:20,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:48:20 BasicIcfg [2022-04-14 22:48:20,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 22:48:20,992 INFO L158 Benchmark]: Toolchain (without parser) took 91556.86ms. Allocated memory was 169.9MB in the beginning and 207.6MB in the end (delta: 37.7MB). Free memory was 121.4MB in the beginning and 171.9MB in the end (delta: -50.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 22:48:20,993 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 22:48:20,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.66ms. Allocated memory is still 169.9MB. Free memory was 121.2MB in the beginning and 147.1MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 22:48:20,993 INFO L158 Benchmark]: Boogie Preprocessor took 48.26ms. Allocated memory is still 169.9MB. Free memory was 147.1MB in the beginning and 145.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 22:48:20,993 INFO L158 Benchmark]: RCFGBuilder took 348.34ms. Allocated memory is still 169.9MB. Free memory was 145.5MB in the beginning and 132.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 22:48:20,993 INFO L158 Benchmark]: IcfgTransformer took 58.32ms. Allocated memory is still 169.9MB. Free memory was 131.9MB in the beginning and 130.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 22:48:20,993 INFO L158 Benchmark]: TraceAbstraction took 90918.78ms. Allocated memory was 169.9MB in the beginning and 207.6MB in the end (delta: 37.7MB). Free memory was 129.8MB in the beginning and 171.9MB in the end (delta: -42.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 22:48:20,994 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 169.9MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.66ms. Allocated memory is still 169.9MB. Free memory was 121.2MB in the beginning and 147.1MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.26ms. Allocated memory is still 169.9MB. Free memory was 147.1MB in the beginning and 145.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 348.34ms. Allocated memory is still 169.9MB. Free memory was 145.5MB in the beginning and 132.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 58.32ms. Allocated memory is still 169.9MB. Free memory was 131.9MB in the beginning and 130.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 90918.78ms. Allocated memory was 169.9MB in the beginning and 207.6MB in the end (delta: 37.7MB). Free memory was 129.8MB in the beginning and 171.9MB in the end (delta: -42.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 537 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 675 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 121 mSDtfsCounter, 675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 77.3s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 18 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 92/116 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 22:48:21,015 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...