/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/cohendiv-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 18:29:41,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 18:29:41,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 18:29:41,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 18:29:41,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 18:29:41,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 18:29:41,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 18:29:41,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 18:29:41,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 18:29:41,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 18:29:41,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 18:29:41,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 18:29:41,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 18:29:41,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 18:29:41,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 18:29:41,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 18:29:41,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 18:29:41,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 18:29:41,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 18:29:41,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 18:29:41,277 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 18:29:41,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 18:29:41,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 18:29:41,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 18:29:41,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 18:29:41,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 18:29:41,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 18:29:41,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 18:29:41,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 18:29:41,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 18:29:41,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 18:29:41,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 18:29:41,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 18:29:41,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 18:29:41,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 18:29:41,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 18:29:41,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 18:29:41,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 18:29:41,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 18:29:41,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 18:29:41,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 18:29:41,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 18:29:41,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 18:29:41,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 18:29:41,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 18:29:41,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 18:29:41,302 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 18:29:41,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 18:29:41,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 18:29:41,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 18:29:41,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 18:29:41,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 18:29:41,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 18:29:41,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 18:29:41,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 18:29:41,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:29:41,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 18:29:41,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 18:29:41,304 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 18:29:41,304 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-07 18:29:41,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 18:29:41,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 18:29:41,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 18:29:41,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 18:29:41,494 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 18:29:41,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-04-07 18:29:41,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41abaa0e/d6b882d38aa340d7bcb36cb188f2e9e6/FLAG4f0512aa1 [2022-04-07 18:29:41,909 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 18:29:41,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-04-07 18:29:41,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41abaa0e/d6b882d38aa340d7bcb36cb188f2e9e6/FLAG4f0512aa1 [2022-04-07 18:29:42,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41abaa0e/d6b882d38aa340d7bcb36cb188f2e9e6 [2022-04-07 18:29:42,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 18:29:42,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 18:29:42,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 18:29:42,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 18:29:42,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 18:29:42,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1fb0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42, skipping insertion in model container [2022-04-07 18:29:42,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 18:29:42,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 18:29:42,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/cohendiv-ll_unwindbound1.c[576,589] [2022-04-07 18:29:42,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:29:42,615 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 18:29:42,629 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/cohendiv-ll_unwindbound1.c[576,589] [2022-04-07 18:29:42,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:29:42,663 INFO L208 MainTranslator]: Completed translation [2022-04-07 18:29:42,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42 WrapperNode [2022-04-07 18:29:42,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 18:29:42,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 18:29:42,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 18:29:42,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 18:29:42,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 18:29:42,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 18:29:42,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 18:29:42,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 18:29:42,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (1/1) ... [2022-04-07 18:29:42,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:29:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:29:42,769 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-07 18:29:42,779 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-07 18:29:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 18:29:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 18:29:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 18:29:42,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 18:29:42,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 18:29:42,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 18:29:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 18:29:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 18:29:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 18:29:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 18:29:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 18:29:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 18:29:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 18:29:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 18:29:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 18:29:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 18:29:42,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 18:29:42,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 18:29:42,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 18:29:42,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 18:29:42,873 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 18:29:42,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 18:29:43,046 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 18:29:43,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 18:29:43,051 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 18:29:43,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:29:43 BoogieIcfgContainer [2022-04-07 18:29:43,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 18:29:43,053 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 18:29:43,053 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 18:29:43,054 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 18:29:43,056 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:29:43" (1/1) ... [2022-04-07 18:29:43,057 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 18:29:43,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:29:43 BasicIcfg [2022-04-07 18:29:43,078 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 18:29:43,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 18:29:43,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 18:29:43,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 18:29:43,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 06:29:42" (1/4) ... [2022-04-07 18:29:43,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eaa15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:29:43, skipping insertion in model container [2022-04-07 18:29:43,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:29:42" (2/4) ... [2022-04-07 18:29:43,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eaa15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:29:43, skipping insertion in model container [2022-04-07 18:29:43,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:29:43" (3/4) ... [2022-04-07 18:29:43,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eaa15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:29:43, skipping insertion in model container [2022-04-07 18:29:43,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:29:43" (4/4) ... [2022-04-07 18:29:43,083 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.cJordan [2022-04-07 18:29:43,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 18:29:43,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 18:29:43,112 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 18:29:43,116 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-07 18:29:43,116 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 18:29:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:29:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 18:29:43,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:29:43,131 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:29:43,132 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:29:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:29:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1213541379, now seen corresponding path program 1 times [2022-04-07 18:29:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:29:43,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058592597] [2022-04-07 18:29:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:29:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:29:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:43,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {41#true} is VALID [2022-04-07 18:29:43,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:29:43,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:29:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:29:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:43,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [104] assume_abort_if_notENTRY-->L12: 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] {41#true} is VALID [2022-04-07 18:29:43,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [107] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 18:29:43,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:29:43,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {41#true} is VALID [2022-04-07 18:29:43,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:29:43,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:29:43,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:29:43,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {41#true} is VALID [2022-04-07 18:29:43,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-07 18:29:43,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [104] assume_abort_if_notENTRY-->L12: 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] {41#true} is VALID [2022-04-07 18:29:43,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [107] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 18:29:43,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {42#false} is VALID [2022-04-07 18:29:43,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} [105] L37-3-->L37-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,271 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {42#false} is VALID [2022-04-07 18:29:43,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-07 18:29:43,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:29:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:29:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:29:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058592597] [2022-04-07 18:29:43,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058592597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:29:43,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:29:43,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 18:29:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646959953] [2022-04-07 18:29:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:29:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 18:29:43,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:29:43,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:43,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:43,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 18:29:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:29:43,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 18:29:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:29:43,318 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:43,450 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-07 18:29:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 18:29:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 18:29:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:29:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-07 18:29:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-07 18:29:43,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-07 18:29:43,506 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-07 18:29:43,518 INFO L225 Difference]: With dead ends: 39 [2022-04-07 18:29:43,518 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 18:29:43,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:29:43,524 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:29:43,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:29:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 18:29:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-07 18:29:43,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:29:43,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,547 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,548 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:43,555 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 18:29:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 18:29:43,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:43,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:43,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-07 18:29:43,557 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-07 18:29:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:43,569 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 18:29:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 18:29:43,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:43,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:43,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:29:43,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:29:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-07 18:29:43,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-07 18:29:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:29:43,577 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-07 18:29:43,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-07 18:29:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 18:29:43,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:29:43,578 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:29:43,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 18:29:43,578 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:29:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:29:43,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1202035559, now seen corresponding path program 1 times [2022-04-07 18:29:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:29:43,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463510277] [2022-04-07 18:29:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:29:43,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:29:43,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731132897] [2022-04-07 18:29:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:43,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:29:43,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:29:43,597 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-07 18:29:43,616 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-07 18:29:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:43,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 18:29:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:43,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:29:43,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-07 18:29:43,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {201#(<= ~counter~0 0)} {193#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {201#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(<= ~counter~0 0)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {201#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(<= ~counter~0 0)} [108] L12-->L12-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[] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {201#(<= ~counter~0 0)} {201#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {201#(<= ~counter~0 0)} is VALID [2022-04-07 18:29:43,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#(<= ~counter~0 0)} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {235#(<= |main_#t~post6| 0)} is VALID [2022-04-07 18:29:43,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= |main_#t~post6| 0)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {194#false} is VALID [2022-04-07 18:29:43,780 INFO L272 TraceCheckUtils]: 14: Hoare triple {194#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {194#false} is VALID [2022-04-07 18:29:43,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {194#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {194#false} is VALID [2022-04-07 18:29:43,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {194#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-07 18:29:43,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {194#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-07 18:29:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:29:43,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:29:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:29:43,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463510277] [2022-04-07 18:29:43,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:29:43,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731132897] [2022-04-07 18:29:43,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731132897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:29:43,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:29:43,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 18:29:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67382583] [2022-04-07 18:29:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:29:43,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-07 18:29:43,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:29:43,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:29:43,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:43,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 18:29:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:29:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 18:29:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 18:29:43,797 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:29:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:43,854 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-07 18:29:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 18:29:43,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-07 18:29:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:29:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:29:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-07 18:29:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:29:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-07 18:29:43,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-07 18:29:43,887 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-07 18:29:43,888 INFO L225 Difference]: With dead ends: 35 [2022-04-07 18:29:43,888 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 18:29:43,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 18:29:43,890 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:29:43,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:29:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 18:29:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-07 18:29:43,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:29:43,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,893 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,893 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:43,895 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-07 18:29:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 18:29:43,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:43,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:43,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-07 18:29:43,896 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-07 18:29:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:43,898 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-07 18:29:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 18:29:43,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:43,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:43,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:29:43,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:29:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 18:29:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-07 18:29:43,901 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-07 18:29:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:29:43,901 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-07 18:29:43,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:29:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 18:29:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 18:29:43,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:29:43,902 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:29:43,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 18:29:44,129 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-07 18:29:44,131 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:29:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:29:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1200933292, now seen corresponding path program 1 times [2022-04-07 18:29:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:29:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362722904] [2022-04-07 18:29:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:29:44,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:29:44,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577528759] [2022-04-07 18:29:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:44,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:29:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:29:44,155 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-07 18:29:44,156 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-07 18:29:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:44,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:29:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:44,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:29:44,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-07 18:29:44,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {390#true} is VALID [2022-04-07 18:29:44,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-07 18:29:44,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-07 18:29:44,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-07 18:29:44,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {390#true} is VALID [2022-04-07 18:29:44,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {390#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {390#true} is VALID [2022-04-07 18:29:44,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#true} [104] assume_abort_if_notENTRY-->L12: 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] {390#true} is VALID [2022-04-07 18:29:44,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#true} [108] L12-->L12-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[] {390#true} is VALID [2022-04-07 18:29:44,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-07 18:29:44,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {390#true} {390#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {390#true} is VALID [2022-04-07 18:29:44,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {428#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-07 18:29:44,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(and (= main_~a~0 0) (= main_~b~0 0))} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {428#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-07 18:29:44,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#(and (= main_~a~0 0) (= main_~b~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {428#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-07 18:29:44,306 INFO L272 TraceCheckUtils]: 14: Hoare triple {428#(and (= main_~a~0 0) (= main_~b~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:29:44,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:29:44,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-07 18:29:44,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {391#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-07 18:29:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:29:44,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:29:44,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:29:44,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362722904] [2022-04-07 18:29:44,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:29:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577528759] [2022-04-07 18:29:44,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577528759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:29:44,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:29:44,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:29:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089453414] [2022-04-07 18:29:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:29:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 18:29:44,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:29:44,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:44,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:44,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:29:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:29:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:29:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:29:44,324 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:44,453 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-07 18:29:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:29:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 18:29:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:29:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-07 18:29:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-07 18:29:44,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-07 18:29:44,498 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-07 18:29:44,499 INFO L225 Difference]: With dead ends: 43 [2022-04-07 18:29:44,499 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 18:29:44,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:29:44,500 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:29:44,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:29:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 18:29:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-07 18:29:44,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:29:44,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 18:29:44,504 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 18:29:44,504 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 18:29:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:44,506 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-07 18:29:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-07 18:29:44,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:44,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:44,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-07 18:29:44,507 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-07 18:29:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:44,508 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-07 18:29:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-07 18:29:44,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:44,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:44,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:29:44,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:29:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 18:29:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-07 18:29:44,511 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-07 18:29:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:29:44,511 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-07 18:29:44,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:29:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-07 18:29:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 18:29:44,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:29:44,512 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:29:44,528 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-07 18:29:44,728 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-07 18:29:44,728 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:29:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:29:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash -944097291, now seen corresponding path program 1 times [2022-04-07 18:29:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:29:44,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878572887] [2022-04-07 18:29:44,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:29:44,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:29:44,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561389237] [2022-04-07 18:29:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:29:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:29:44,743 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-07 18:29:44,744 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-07 18:29:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:44,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:29:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:44,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:29:44,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-07 18:29:44,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {619#true} is VALID [2022-04-07 18:29:44,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-07 18:29:44,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-07 18:29:44,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-07 18:29:44,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {619#true} is VALID [2022-04-07 18:29:44,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-07 18:29:44,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} [104] assume_abort_if_notENTRY-->L12: 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] {619#true} is VALID [2022-04-07 18:29:44,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {619#true} [108] L12-->L12-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[] {619#true} is VALID [2022-04-07 18:29:44,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-07 18:29:44,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {619#true} {619#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-07 18:29:44,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {619#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:44,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:44,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:44,896 INFO L272 TraceCheckUtils]: 14: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {619#true} is VALID [2022-04-07 18:29:44,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#true} is VALID [2022-04-07 18:29:44,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#true} [118] L15-->L15-2: Formula: (not (= 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[] {619#true} is VALID [2022-04-07 18:29:44,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {619#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-07 18:29:44,901 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {619#true} {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:44,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {682#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:29:44,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {686#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:29:44,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {686#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-07 18:29:44,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {620#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-07 18:29:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:29:44,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:29:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:29:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878572887] [2022-04-07 18:29:44,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:29:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561389237] [2022-04-07 18:29:44,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561389237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:29:44,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:29:44,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:29:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564463897] [2022-04-07 18:29:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:29:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 18:29:44,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:29:44,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:29:44,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:44,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:29:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:29:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:29:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:29:44,926 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:29:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:45,084 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-07 18:29:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:29:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 18:29:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:29:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:29:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 18:29:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:29:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 18:29:45,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-07 18:29:45,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:45,145 INFO L225 Difference]: With dead ends: 56 [2022-04-07 18:29:45,145 INFO L226 Difference]: Without dead ends: 55 [2022-04-07 18:29:45,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:29:45,146 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:29:45,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:29:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-07 18:29:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-07 18:29:45,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:29:45,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 18:29:45,150 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 18:29:45,150 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 18:29:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:45,152 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-07 18:29:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-07 18:29:45,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:45,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:45,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-07 18:29:45,154 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-07 18:29:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:45,155 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-07 18:29:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-07 18:29:45,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:45,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:45,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:29:45,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:29:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 18:29:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-07 18:29:45,158 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-07 18:29:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:29:45,158 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-07 18:29:45,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:29:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-07 18:29:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 18:29:45,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:29:45,159 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:29:45,177 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-07 18:29:45,375 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-07 18:29:45,375 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:29:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:29:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -653220550, now seen corresponding path program 1 times [2022-04-07 18:29:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:29:45,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899877761] [2022-04-07 18:29:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:29:45,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:29:45,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330993075] [2022-04-07 18:29:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:45,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:29:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:29:45,392 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-07 18:29:45,393 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-07 18:29:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:45,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:29:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:45,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:29:45,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-07 18:29:45,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#(<= 0 ~counter~0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#(<= 0 ~counter~0)} {914#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#(<= 0 ~counter~0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#(<= 0 ~counter~0)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#(<= 0 ~counter~0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#(<= 0 ~counter~0)} [104] assume_abort_if_notENTRY-->L12: 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] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#(<= 0 ~counter~0)} [108] L12-->L12-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[] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#(<= 0 ~counter~0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#(<= 0 ~counter~0)} {922#(<= 0 ~counter~0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#(<= 0 ~counter~0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {922#(<= 0 ~counter~0)} is VALID [2022-04-07 18:29:45,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {922#(<= 0 ~counter~0)} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {956#(<= 1 ~counter~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,609 INFO L272 TraceCheckUtils]: 14: Hoare triple {956#(<= 1 ~counter~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {956#(<= 1 ~counter~0)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#(<= 1 ~counter~0)} [118] L15-->L15-2: Formula: (not (= 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[] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {956#(<= 1 ~counter~0)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,611 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {956#(<= 1 ~counter~0)} {956#(<= 1 ~counter~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {956#(<= 1 ~counter~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {956#(<= 1 ~counter~0)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {956#(<= 1 ~counter~0)} [118] L15-->L15-2: Formula: (not (= 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[] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {956#(<= 1 ~counter~0)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,614 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {956#(<= 1 ~counter~0)} {956#(<= 1 ~counter~0)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {956#(<= 1 ~counter~0)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {956#(<= 1 ~counter~0)} is VALID [2022-04-07 18:29:45,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {956#(<= 1 ~counter~0)} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {996#(<= 1 |main_#t~post7|)} is VALID [2022-04-07 18:29:45,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {996#(<= 1 |main_#t~post7|)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 1) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {915#false} is VALID [2022-04-07 18:29:45,616 INFO L272 TraceCheckUtils]: 27: Hoare triple {915#false} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {915#false} is VALID [2022-04-07 18:29:45,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {915#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {915#false} is VALID [2022-04-07 18:29:45,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {915#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-07 18:29:45,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {915#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-07 18:29:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 18:29:45,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:29:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:29:45,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899877761] [2022-04-07 18:29:45,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:29:45,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330993075] [2022-04-07 18:29:45,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330993075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:29:45,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:29:45,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:29:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871994805] [2022-04-07 18:29:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:29:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-07 18:29:45,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:29:45,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 18:29:45,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:45,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:29:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:29:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:29:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:29:45,639 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 18:29:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:45,707 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-07 18:29:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:29:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-07 18:29:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:29:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 18:29:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 18:29:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 18:29:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 18:29:45,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-07 18:29:45,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:45,731 INFO L225 Difference]: With dead ends: 42 [2022-04-07 18:29:45,731 INFO L226 Difference]: Without dead ends: 42 [2022-04-07 18:29:45,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:29:45,732 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:29:45,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:29:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-07 18:29:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-07 18:29:45,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:29:45,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 18:29:45,734 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 18:29:45,734 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 18:29:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:45,736 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-07 18:29:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-07 18:29:45,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:45,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:45,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-04-07 18:29:45,736 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-04-07 18:29:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:45,737 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-07 18:29:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-07 18:29:45,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:45,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:45,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:29:45,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:29:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 18:29:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-07 18:29:45,739 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 31 [2022-04-07 18:29:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:29:45,739 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-07 18:29:45,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 18:29:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-07 18:29:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 18:29:45,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:29:45,739 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-04-07 18:29:45,755 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-07 18:29:45,955 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-07 18:29:45,955 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:29:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:29:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -830156892, now seen corresponding path program 1 times [2022-04-07 18:29:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:29:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476602383] [2022-04-07 18:29:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:29:45,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:29:45,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656902599] [2022-04-07 18:29:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:29:45,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:29:45,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:29:45,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 18:29:45,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 18:29:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:46,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 18:29:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:29:46,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:29:46,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1179#true} is VALID [2022-04-07 18:29:46,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1179#true} is VALID [2022-04-07 18:29:46,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1179#true} is VALID [2022-04-07 18:29:46,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} [104] assume_abort_if_notENTRY-->L12: 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] {1179#true} is VALID [2022-04-07 18:29:46,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} [108] L12-->L12-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[] {1179#true} is VALID [2022-04-07 18:29:46,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1179#true} is VALID [2022-04-07 18:29:46,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,204 INFO L272 TraceCheckUtils]: 14: Hoare triple {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1179#true} is VALID [2022-04-07 18:29:46,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1179#true} is VALID [2022-04-07 18:29:46,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {1179#true} [118] L15-->L15-2: Formula: (not (= 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[] {1179#true} is VALID [2022-04-07 18:29:46,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {1179#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,205 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1179#true} {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,205 INFO L272 TraceCheckUtils]: 19: Hoare triple {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1179#true} is VALID [2022-04-07 18:29:46,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1179#true} is VALID [2022-04-07 18:29:46,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#true} [118] L15-->L15-2: Formula: (not (= 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[] {1179#true} is VALID [2022-04-07 18:29:46,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,206 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1179#true} {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {1217#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1257#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {1257#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1257#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1257#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 18:29:46,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {1257#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1267#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-07 18:29:46,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {1267#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1267#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-07 18:29:46,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {1267#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1267#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-07 18:29:46,208 INFO L272 TraceCheckUtils]: 30: Hoare triple {1267#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:29:46,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {1277#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:29:46,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-07 18:29:46,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {1180#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-07 18:29:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 18:29:46,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:29:46,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {1180#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-07 18:29:46,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-07 18:29:46,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {1277#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:29:46,360 INFO L272 TraceCheckUtils]: 30: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:29:46,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {1307#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {1307#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1307#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-07 18:29:46,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {1307#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [126] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1307#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-07 18:29:46,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1307#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-07 18:29:46,368 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1179#true} {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#true} [118] L15-->L15-2: Formula: (not (= 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[] {1179#true} is VALID [2022-04-07 18:29:46,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1179#true} is VALID [2022-04-07 18:29:46,368 INFO L272 TraceCheckUtils]: 19: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} 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, main_~r~0] {1179#true} is VALID [2022-04-07 18:29:46,369 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1179#true} {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {1179#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {1179#true} [118] L15-->L15-2: Formula: (not (= 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[] {1179#true} is VALID [2022-04-07 18:29:46,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1179#true} is VALID [2022-04-07 18:29:46,369 INFO L272 TraceCheckUtils]: 14: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1179#true} is VALID [2022-04-07 18:29:46,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [106] L37-3-->L37-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1297#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 18:29:46,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} [108] L12-->L12-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[] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} [104] assume_abort_if_notENTRY-->L12: 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] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} [98] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1179#true} is VALID [2022-04-07 18:29:46,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#true} is VALID [2022-04-07 18:29:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 18:29:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:29:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476602383] [2022-04-07 18:29:46,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:29:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656902599] [2022-04-07 18:29:46,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656902599] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 18:29:46,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 18:29:46,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-04-07 18:29:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398071691] [2022-04-07 18:29:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:29:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 18:29:46,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:29:46,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:29:46,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:46,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 18:29:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:29:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 18:29:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 18:29:46,393 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:29:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:46,544 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-07 18:29:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:29:46,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 18:29:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:29:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:29:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-07 18:29:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:29:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-07 18:29:46,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-04-07 18:29:46,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:29:46,574 INFO L225 Difference]: With dead ends: 38 [2022-04-07 18:29:46,574 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 18:29:46,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-07 18:29:46,575 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:29:46,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 18:29:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 18:29:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 18:29:46,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:29:46,575 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-07 18:29:46,575 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-07 18:29:46,575 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-07 18:29:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:46,576 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 18:29:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 18:29:46,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:46,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:46,576 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-07 18:29:46,576 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-07 18:29:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:29:46,576 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 18:29:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 18:29:46,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:46,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:29:46,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:29:46,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:29:46,576 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-07 18:29:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 18:29:46,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-07 18:29:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:29:46,576 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 18:29:46,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:29:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 18:29:46,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:29:46,578 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 18:29:46,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 18:29:46,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:29:46,789 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-07 18:29:46,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 18:29:46,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:29:46 BasicIcfg [2022-04-07 18:29:46,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 18:29:46,792 INFO L158 Benchmark]: Toolchain (without parser) took 4434.44ms. Allocated memory was 188.7MB in the beginning and 239.1MB in the end (delta: 50.3MB). Free memory was 132.7MB in the beginning and 150.9MB in the end (delta: -18.2MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2022-04-07 18:29:46,793 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 18:29:46,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.55ms. Allocated memory was 188.7MB in the beginning and 239.1MB in the end (delta: 50.3MB). Free memory was 132.4MB in the beginning and 208.3MB in the end (delta: -75.9MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2022-04-07 18:29:46,793 INFO L158 Benchmark]: Boogie Preprocessor took 52.97ms. Allocated memory is still 239.1MB. Free memory was 208.3MB in the beginning and 206.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 18:29:46,793 INFO L158 Benchmark]: RCFGBuilder took 334.61ms. Allocated memory is still 239.1MB. Free memory was 206.7MB in the beginning and 194.7MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 18:29:46,793 INFO L158 Benchmark]: IcfgTransformer took 24.75ms. Allocated memory is still 239.1MB. Free memory was 194.7MB in the beginning and 193.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 18:29:46,793 INFO L158 Benchmark]: TraceAbstraction took 3713.12ms. Allocated memory is still 239.1MB. Free memory was 192.4MB in the beginning and 150.9MB in the end (delta: 41.6MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-04-07 18:29:46,794 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.09ms. Allocated memory is still 188.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.55ms. Allocated memory was 188.7MB in the beginning and 239.1MB in the end (delta: 50.3MB). Free memory was 132.4MB in the beginning and 208.3MB in the end (delta: -75.9MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.97ms. Allocated memory is still 239.1MB. Free memory was 208.3MB in the beginning and 206.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 334.61ms. Allocated memory is still 239.1MB. Free memory was 206.7MB in the beginning and 194.7MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 24.75ms. Allocated memory is still 239.1MB. Free memory was 194.7MB in the beginning and 193.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3713.12ms. Allocated memory is still 239.1MB. Free memory was 192.4MB in the beginning and 150.9MB in the end (delta: 41.6MB). Peak memory consumption was 43.1MB. 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: 17]: 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 216 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 SizeOfPredicates, 8 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 28/30 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-07 18:29:46,820 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...