/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/egcd2-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:15:25,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:15:25,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:15:25,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:15:25,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:15:25,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:15:25,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:15:25,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:15:25,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:15:25,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:15:25,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:15:25,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:15:25,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:15:25,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:15:25,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:15:25,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:15:25,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:15:25,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:15:25,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:15:25,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:15:25,135 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:15:25,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:15:25,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:15:25,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:15:25,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:15:25,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:15:25,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:15:25,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:15:25,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:15:25,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:15:25,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:15:25,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:15:25,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:15:25,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:15:25,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:15:25,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:15:25,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:15:25,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:15:25,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:15:25,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:15:25,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:15:25,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:15:25,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:15:25,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:15:25,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:15:25,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:15:25,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:15:25,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:15:25,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:15:25,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:15:25,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:15:25,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:15:25,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:15:25,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:15:25,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:15:25,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:15:25,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:15:25,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:15:25,176 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:15:25,176 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 21:15:25,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:15:25,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:15:25,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:15:25,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:15:25,369 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:15:25,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c [2022-04-14 21:15:25,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0017f38/2a316ddd91f84de69ed9fde84f10e24f/FLAG385e4bd26 [2022-04-14 21:15:25,778 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:15:25,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c [2022-04-14 21:15:25,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0017f38/2a316ddd91f84de69ed9fde84f10e24f/FLAG385e4bd26 [2022-04-14 21:15:26,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0017f38/2a316ddd91f84de69ed9fde84f10e24f [2022-04-14 21:15:26,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:15:26,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:15:26,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:15:26,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:15:26,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:15:26,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19767093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26, skipping insertion in model container [2022-04-14 21:15:26,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:15:26,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:15:26,374 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/egcd2-ll_unwindbound1.c[490,503] [2022-04-14 21:15:26,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:15:26,402 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:15:26,423 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/egcd2-ll_unwindbound1.c[490,503] [2022-04-14 21:15:26,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:15:26,440 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:15:26,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26 WrapperNode [2022-04-14 21:15:26,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:15:26,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:15:26,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:15:26,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:15:26,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:15:26,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:15:26,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:15:26,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:15:26,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:15:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:15:26,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 21:15:26,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 21:15:26,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:15:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:15:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:15:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:15:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:15:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:15:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:15:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:15:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:15:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:15:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:15:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:15:26,574 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:15:26,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:15:26,766 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:15:26,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:15:26,771 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 21:15:26,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:15:26 BoogieIcfgContainer [2022-04-14 21:15:26,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:15:26,773 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:15:26,773 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:15:26,774 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:15:26,776 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:15:26" (1/1) ... [2022-04-14 21:15:26,778 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:15:26,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:15:26 BasicIcfg [2022-04-14 21:15:26,800 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:15:26,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:15:26,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:15:26,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:15:26,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:15:26" (1/4) ... [2022-04-14 21:15:26,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:15:26, skipping insertion in model container [2022-04-14 21:15:26,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:15:26" (2/4) ... [2022-04-14 21:15:26,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:15:26, skipping insertion in model container [2022-04-14 21:15:26,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:15:26" (3/4) ... [2022-04-14 21:15:26,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:15:26, skipping insertion in model container [2022-04-14 21:15:26,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:15:26" (4/4) ... [2022-04-14 21:15:26,811 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound1.cJordan [2022-04-14 21:15:26,815 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:15:26,815 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:15:26,844 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:15:26,849 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 21:15:26,850 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:15:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 21:15:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 21:15:26,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:15:26,868 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:15:26,869 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:15:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:15:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-04-14 21:15:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:15:26,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119499547] [2022-04-14 21:15:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:15:26,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:15:26,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378097486] [2022-04-14 21:15:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:26,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:26,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:15:26,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:15:26,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 21:15:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:27,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 21:15:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:27,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:15:27,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {42#true} is VALID [2022-04-14 21:15:27,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [105] mainENTRY-->L24: 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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~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_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {42#true} is VALID [2022-04-14 21:15:27,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-14 21:15:27,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-14 21:15:27,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-14 21:15:27,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-14 21:15:27,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {42#true} is VALID [2022-04-14 21:15:27,202 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-14 21:15:27,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-14 21:15:27,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,202 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,203 INFO L272 TraceCheckUtils]: 22: Hoare triple {42#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-14 21:15:27,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-14 21:15:27,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 21:15:27,203 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42#true} {42#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-14 21:15:27,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#true} [116] L40-2-->L40-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-14 21:15:27,208 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {43#false} is VALID [2022-04-14 21:15:27,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} [122] __VERIFIER_assertENTRY-->L11: 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] {43#false} is VALID [2022-04-14 21:15:27,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} [126] L11-->L12: 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[] {43#false} is VALID [2022-04-14 21:15:27,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-14 21:15:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:15:27,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:15:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:15:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119499547] [2022-04-14 21:15:27,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:15:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378097486] [2022-04-14 21:15:27,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378097486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:15:27,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:15:27,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 21:15:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247716598] [2022-04-14 21:15:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:15:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-14 21:15:27,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:15:27,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:15:27,251 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-14 21:15:27,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 21:15:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:15:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 21:15:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 21:15:27,273 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:15:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:27,317 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-14 21:15:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 21:15:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-14 21:15:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:15:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:15:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-04-14 21:15:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:15:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-04-14 21:15:27,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2022-04-14 21:15:27,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:27,374 INFO L225 Difference]: With dead ends: 39 [2022-04-14 21:15:27,374 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 21:15:27,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 21:15:27,378 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:15:27,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:15:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 21:15:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-14 21:15:27,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:15:27,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:27,401 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:27,401 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:27,405 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-14 21:15:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-14 21:15:27,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:27,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:27,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-14 21:15:27,431 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-14 21:15:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:27,446 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-14 21:15:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-14 21:15:27,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:27,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:27,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:15:27,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:15:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-14 21:15:27,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-14 21:15:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:15:27,456 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-14 21:15:27,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 21:15:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-14 21:15:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 21:15:27,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:15:27,460 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:15:27,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 21:15:27,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-14 21:15:27,676 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:15:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:15:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-04-14 21:15:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:15:27,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549628904] [2022-04-14 21:15:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:15:27,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:15:27,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776190609] [2022-04-14 21:15:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:27,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:27,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:15:27,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:15:27,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 21:15:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:27,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 21:15:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:27,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:15:27,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {280#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {280#true} is VALID [2022-04-14 21:15:27,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#(<= ~counter~0 0)} {280#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#(<= ~counter~0 0)} [105] mainENTRY-->L24: 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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~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_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {288#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-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[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,962 INFO L272 TraceCheckUtils]: 11: Hoare triple {288#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-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[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,963 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {288#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,968 INFO L272 TraceCheckUtils]: 17: Hoare triple {288#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-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[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,971 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,972 INFO L272 TraceCheckUtils]: 22: Hoare triple {288#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-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[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,976 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-14 21:15:27,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {288#(<= ~counter~0 0)} [117] L40-2-->L40: 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] {367#(<= |main_#t~post6| 0)} is VALID [2022-04-14 21:15:27,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {367#(<= |main_#t~post6| 0)} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {281#false} is VALID [2022-04-14 21:15:27,977 INFO L272 TraceCheckUtils]: 29: Hoare triple {281#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {281#false} is VALID [2022-04-14 21:15:27,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {281#false} [122] __VERIFIER_assertENTRY-->L11: 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] {281#false} is VALID [2022-04-14 21:15:27,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {281#false} [126] L11-->L12: 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[] {281#false} is VALID [2022-04-14 21:15:27,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {281#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {281#false} is VALID [2022-04-14 21:15:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:15:27,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:15:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:15:27,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549628904] [2022-04-14 21:15:27,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:15:27,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776190609] [2022-04-14 21:15:27,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776190609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:15:27,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:15:27,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 21:15:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135036447] [2022-04-14 21:15:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:15:27,980 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 21:15:27,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:15:27,980 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:28,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:28,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 21:15:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:15:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 21:15:28,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:15:28,002 INFO L87 Difference]: Start difference. First operand 34 states and 45 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:28,081 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-14 21:15:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 21:15:28,081 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 21:15:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:15:28,083 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-14 21:15:28,090 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-14 21:15:28,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-14 21:15:28,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:28,130 INFO L225 Difference]: With dead ends: 36 [2022-04-14 21:15:28,130 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 21:15:28,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-14 21:15:28,133 INFO L913 BasicCegarLoop]: 43 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, 110 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-14 21:15:28,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:15:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 21:15:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 21:15:28,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:15:28,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:28,143 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:28,144 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:28,147 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-14 21:15:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 21:15:28,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:28,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:28,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 21:15:28,160 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 21:15:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:28,162 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-14 21:15:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 21:15:28,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:28,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:28,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:15:28,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:15:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-14 21:15:28,164 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-14 21:15:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:15:28,164 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-14 21:15:28,165 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 21:15:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 21:15:28,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:15:28,165 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:15:28,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 21:15:28,366 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,SelfDestructingSolverStorable1 [2022-04-14 21:15:28,366 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:15:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:15:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-04-14 21:15:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:15:28,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005023257] [2022-04-14 21:15:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:15:28,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:15:28,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791951929] [2022-04-14 21:15:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:28,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:28,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:15:28,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:15:28,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 21:15:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:28,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:15:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:28,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:15:28,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {526#true} is VALID [2022-04-14 21:15:28,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [105] mainENTRY-->L24: 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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~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_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} [112] L8-->L8-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[] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {526#true} {526#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {567#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 21:15:28,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-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[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 21:15:28,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 21:15:28,588 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {571#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {578#(<= 1 main_~y~0)} is VALID [2022-04-14 21:15:28,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,589 INFO L272 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {526#true} is VALID [2022-04-14 21:15:28,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} [112] L8-->L8-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[] {526#true} is VALID [2022-04-14 21:15:28,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,590 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,590 INFO L272 TraceCheckUtils]: 22: Hoare triple {582#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {526#true} is VALID [2022-04-14 21:15:28,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} [112] L8-->L8-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[] {526#true} is VALID [2022-04-14 21:15:28,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,591 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#(<= 1 main_~b~0)} [117] L40-2-->L40: 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] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {582#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {582#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-14 21:15:28,592 INFO L272 TraceCheckUtils]: 30: Hoare triple {527#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {527#false} is VALID [2022-04-14 21:15:28,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {527#false} [122] __VERIFIER_assertENTRY-->L11: 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] {527#false} is VALID [2022-04-14 21:15:28,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {527#false} [126] L11-->L12: 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[] {527#false} is VALID [2022-04-14 21:15:28,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {527#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-14 21:15:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 21:15:28,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:15:28,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {527#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-14 21:15:28,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {527#false} [126] L11-->L12: 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[] {527#false} is VALID [2022-04-14 21:15:28,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {527#false} [122] __VERIFIER_assertENTRY-->L11: 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] {527#false} is VALID [2022-04-14 21:15:28,805 INFO L272 TraceCheckUtils]: 30: Hoare triple {527#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {527#false} is VALID [2022-04-14 21:15:28,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {582#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-14 21:15:28,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {582#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#(<= 1 main_~b~0)} [117] L40-2-->L40: 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] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,809 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} [112] L8-->L8-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[] {526#true} is VALID [2022-04-14 21:15:28,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {526#true} is VALID [2022-04-14 21:15:28,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {582#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} [112] L8-->L8-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[] {526#true} is VALID [2022-04-14 21:15:28,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {526#true} is VALID [2022-04-14 21:15:28,813 INFO L272 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {582#(<= 1 main_~b~0)} is VALID [2022-04-14 21:15:28,819 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {571#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {578#(<= 1 main_~y~0)} is VALID [2022-04-14 21:15:28,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 21:15:28,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [112] L8-->L8-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[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 21:15:28,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {697#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 21:15:28,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {526#true} {526#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} [112] L8-->L8-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[] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: 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] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [105] mainENTRY-->L24: 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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~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_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {526#true} is VALID [2022-04-14 21:15:28,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {526#true} is VALID [2022-04-14 21:15:28,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-14 21:15:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 21:15:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:15:28,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005023257] [2022-04-14 21:15:28,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:15:28,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791951929] [2022-04-14 21:15:28,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791951929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:15:28,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:15:28,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-14 21:15:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964151149] [2022-04-14 21:15:28,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:15:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 21:15:28,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:15:28,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:28,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:28,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 21:15:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:15:28,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 21:15:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 21:15:28,858 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:29,149 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-14 21:15:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 21:15:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 21:15:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:15:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-14 21:15:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-14 21:15:29,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-14 21:15:29,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:29,197 INFO L225 Difference]: With dead ends: 45 [2022-04-14 21:15:29,197 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 21:15:29,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-14 21:15:29,198 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:15:29,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 21:15:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 21:15:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-14 21:15:29,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:15:29,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:29,202 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:29,202 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:29,205 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-14 21:15:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-14 21:15:29,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:29,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:29,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 21:15:29,206 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 21:15:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:29,210 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-14 21:15:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-14 21:15:29,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:29,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:29,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:15:29,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:15:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:15:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-14 21:15:29,212 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-14 21:15:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:15:29,213 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-14 21:15:29,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-14 21:15:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 21:15:29,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:15:29,214 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:15:29,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 21:15:29,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:29,429 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:15:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:15:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-04-14 21:15:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:15:29,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112546323] [2022-04-14 21:15:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:15:29,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:15:29,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440676338] [2022-04-14 21:15:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:29,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:15:29,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:15:29,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 21:15:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:29,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:15:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:15:29,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:15:29,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-14 21:15:29,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 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] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#(<= 0 ~counter~0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#(<= 0 ~counter~0)} {912#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#(<= 0 ~counter~0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#(<= 0 ~counter~0)} [105] mainENTRY-->L24: 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_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~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_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#(<= 0 ~counter~0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-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[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,669 INFO L272 TraceCheckUtils]: 11: Hoare triple {920#(<= 0 ~counter~0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-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[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#(<= 0 ~counter~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,672 INFO L272 TraceCheckUtils]: 17: Hoare triple {920#(<= 0 ~counter~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-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[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,673 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {920#(<= 0 ~counter~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-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[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,675 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID [2022-04-14 21:15:29,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {920#(<= 0 ~counter~0)} [117] L40-2-->L40: 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] {999#(<= 1 ~counter~0)} is VALID [2022-04-14 21:15:29,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {999#(<= 1 ~counter~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {999#(<= 1 ~counter~0)} is VALID [2022-04-14 21:15:29,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {999#(<= 1 ~counter~0)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {999#(<= 1 ~counter~0)} is VALID [2022-04-14 21:15:29,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {999#(<= 1 ~counter~0)} [129] 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] {1009#(<= 1 |main_#t~post7|)} is VALID [2022-04-14 21:15:29,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {1009#(<= 1 |main_#t~post7|)} [136] 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] {913#false} is VALID [2022-04-14 21:15:29,677 INFO L272 TraceCheckUtils]: 32: Hoare triple {913#false} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {913#false} is VALID [2022-04-14 21:15:29,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} [122] __VERIFIER_assertENTRY-->L11: 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] {913#false} is VALID [2022-04-14 21:15:29,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {913#false} [126] L11-->L12: 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[] {913#false} is VALID [2022-04-14 21:15:29,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {913#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#false} is VALID [2022-04-14 21:15:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 21:15:29,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:15:29,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:15:29,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112546323] [2022-04-14 21:15:29,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:15:29,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440676338] [2022-04-14 21:15:29,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440676338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:15:29,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:15:29,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:15:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596797042] [2022-04-14 21:15:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:15:29,680 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 21:15:29,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:15:29,680 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:29,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:15:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:15:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:15:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:15:29,699 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:29,772 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-14 21:15:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:15:29,772 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 21:15:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:15:29,773 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-14 21:15:29,774 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-14 21:15:29,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-14 21:15:29,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:15:29,798 INFO L225 Difference]: With dead ends: 32 [2022-04-14 21:15:29,798 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 21:15:29,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-14 21:15:29,799 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:15:29,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:15:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 21:15:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 21:15:29,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:15:29,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:15:29,802 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:15:29,802 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:15:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:29,803 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-14 21:15:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-14 21:15:29,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:29,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:29,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-14 21:15:29,804 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-14 21:15:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:15:29,805 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-14 21:15:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-14 21:15:29,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:15:29,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:15:29,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:15:29,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:15:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 21:15:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-14 21:15:29,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 36 [2022-04-14 21:15:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:15:29,807 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-14 21:15:29,807 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:15:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-14 21:15:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 21:15:29,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:15:29,808 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:15:29,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 21:15:30,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:30,016 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:15:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:15:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-04-14 21:15:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:15:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282449114] [2022-04-14 21:15:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:15:30,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:15:30,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996728379] [2022-04-14 21:15:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:15:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:15:30,068 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-14 21:15:30,072 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-14 21:15:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 21:15:30,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 21:15:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 21:15:30,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 21:15:30,148 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 21:15:30,149 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 21:15:30,175 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-14 21:15:30,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:15:30,378 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-14 21:15:30,381 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 21:15:30,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:15:30 BasicIcfg [2022-04-14 21:15:30,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 21:15:30,406 INFO L158 Benchmark]: Toolchain (without parser) took 4174.04ms. Allocated memory was 187.7MB in the beginning and 239.1MB in the end (delta: 51.4MB). Free memory was 138.9MB in the beginning and 155.8MB in the end (delta: -16.9MB). Peak memory consumption was 34.8MB. Max. memory is 8.0GB. [2022-04-14 21:15:30,406 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 21:15:30,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.93ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 164.0MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 21:15:30,407 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 187.7MB. Free memory was 164.0MB in the beginning and 162.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 21:15:30,407 INFO L158 Benchmark]: RCFGBuilder took 308.55ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 149.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 21:15:30,407 INFO L158 Benchmark]: IcfgTransformer took 26.94ms. Allocated memory is still 187.7MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 21:15:30,408 INFO L158 Benchmark]: TraceAbstraction took 3604.20ms. Allocated memory was 187.7MB in the beginning and 239.1MB in the end (delta: 51.4MB). Free memory was 146.8MB in the beginning and 155.8MB in the end (delta: -9.0MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. [2022-04-14 21:15:30,409 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.13ms. Allocated memory is still 187.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.93ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 164.0MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 187.7MB. Free memory was 164.0MB in the beginning and 162.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 308.55ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 149.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 26.94ms. Allocated memory is still 187.7MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3604.20ms. Allocated memory was 187.7MB in the beginning and 239.1MB in the end (delta: 51.4MB). Free memory was 146.8MB in the beginning and 155.8MB in the end (delta: -9.0MB). Peak memory consumption was 43.3MB. 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=6, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=1, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=1, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L40] COND TRUE counter++<1 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1, b=1, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L46] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L46] COND FALSE !(counter++<1) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=1, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=1, y=1, yy=1] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=1, y=1, yy=1] [L40] COND FALSE !(counter++<1) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 163 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 5 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 108/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 21:15:30,444 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...