/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:09:46,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:09:46,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:09:46,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:09:46,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:09:46,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:09:46,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:09:46,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:09:46,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:09:46,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:09:46,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:09:46,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:09:46,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:09:46,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:09:46,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:09:46,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:09:46,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:09:46,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:09:46,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:09:46,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:09:46,203 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:09:46,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:09:46,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:09:46,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:09:46,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:09:46,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:09:46,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:09:46,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:09:46,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:09:46,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:09:46,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:09:46,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:09:46,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:09:46,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:09:46,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:09:46,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:09:46,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:09:46,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:09:46,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:09:46,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:09:46,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:09:46,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:09:46,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:09:46,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:09:46,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:09:46,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:09:46,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:09:46,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:09:46,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:09:46,251 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:09:46,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:09:46,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:09:46,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:09:46,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:09:46,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:09:46,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:09:46,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:09:46,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:09:46,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:09:46,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:09:46,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:09:46,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:09:46,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:09:46,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:09:46,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:09:46,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:09:46,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:09:46,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:09:46,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:09:46,255 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:09:46,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:09:46,257 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:09:46,258 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-27 23:09:46,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:09:46,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:09:46,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:09:46,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:09:46,493 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:09:46,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-27 23:09:46,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d57a8dab/f98a81ace2e646c3b1c0412ebbdbdaf2/FLAGb63f19f90 [2022-04-27 23:09:46,930 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:09:46,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-27 23:09:46,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d57a8dab/f98a81ace2e646c3b1c0412ebbdbdaf2/FLAGb63f19f90 [2022-04-27 23:09:46,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d57a8dab/f98a81ace2e646c3b1c0412ebbdbdaf2 [2022-04-27 23:09:46,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:09:46,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:09:46,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:09:46,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:09:46,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:09:46,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:09:46" (1/1) ... [2022-04-27 23:09:46,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b0d4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:46, skipping insertion in model container [2022-04-27 23:09:46,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:09:46" (1/1) ... [2022-04-27 23:09:46,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:09:46,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:09:47,119 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/dijkstra-u_valuebound5.c[525,538] [2022-04-27 23:09:47,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:09:47,153 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:09:47,163 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/dijkstra-u_valuebound5.c[525,538] [2022-04-27 23:09:47,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:09:47,187 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:09:47,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47 WrapperNode [2022-04-27 23:09:47,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:09:47,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:09:47,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:09:47,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:09:47,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:09:47,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:09:47,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:09:47,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:09:47,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:09:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:47,250 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-27 23:09:47,252 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-27 23:09:47,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:09:47,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:09:47,285 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:09:47,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:09:47,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:09:47,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:09:47,286 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:09:47,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:09:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:09:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:09:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 23:09:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:09:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:09:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:09:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:09:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:09:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:09:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:09:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:09:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:09:47,351 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:09:47,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:09:47,624 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:09:47,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:09:47,629 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:09:47,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:09:47 BoogieIcfgContainer [2022-04-27 23:09:47,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:09:47,631 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:09:47,632 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:09:47,632 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:09:47,635 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:09:47" (1/1) ... [2022-04-27 23:09:47,637 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:09:47,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:09:47 BasicIcfg [2022-04-27 23:09:47,667 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:09:47,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:09:47,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:09:47,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:09:47,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:09:46" (1/4) ... [2022-04-27 23:09:47,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bff0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:09:47, skipping insertion in model container [2022-04-27 23:09:47,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:47" (2/4) ... [2022-04-27 23:09:47,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bff0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:09:47, skipping insertion in model container [2022-04-27 23:09:47,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:09:47" (3/4) ... [2022-04-27 23:09:47,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bff0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:09:47, skipping insertion in model container [2022-04-27 23:09:47,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:09:47" (4/4) ... [2022-04-27 23:09:47,673 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.cqvasr [2022-04-27 23:09:47,684 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:09:47,684 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:09:47,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:09:47,726 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4664bbb6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d7e987b [2022-04-27 23:09:47,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:09:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:09:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:09:47,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:47,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:47,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 890522097, now seen corresponding path program 1 times [2022-04-27 23:09:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:47,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224035009] [2022-04-27 23:09:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:09:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:47,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-27 23:09:47,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:09:47,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:09:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:09:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:47,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 23:09:47,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:47,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:47,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:09:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:09:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:48,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 23:09:48,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:09:48,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:09:48,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-27 23:09:48,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:09:48,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:09:48,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:09:48,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {41#true} is VALID [2022-04-27 23:09:48,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 23:09:48,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 23:09:48,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:09:48,008 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 23:09:48,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 23:09:48,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:09:48,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 23:09:48,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} [118] L30-2-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} [122] L52-2-->L38-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,010 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} [127] L38-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_24 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0) (* (* v_main_~n~0_24 .cse0) 4294967295))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_24, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 23:09:48,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-27 23:09:48,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:09:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:09:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:48,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224035009] [2022-04-27 23:09:48,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224035009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:09:48,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:09:48,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:09:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551265942] [2022-04-27 23:09:48,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:09:48,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:09:48,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:48,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:48,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:09:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:09:48,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:09:48,093 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:50,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:50,551 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-27 23:09:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:09:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:09:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 23:09:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 23:09:50,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-27 23:09:50,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:50,722 INFO L225 Difference]: With dead ends: 69 [2022-04-27 23:09:50,723 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 23:09:50,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:09:50,727 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:50,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 23:09:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 23:09:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 23:09:50,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:50,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:09:50,752 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:09:50,753 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:09:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:50,758 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 23:09:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 23:09:50,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:50,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:50,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 23:09:50,760 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 23:09:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:50,764 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 23:09:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 23:09:50,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:50,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:50,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:50,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:09:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 23:09:50,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 23:09:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:50,770 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 23:09:50,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 23:09:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:09:50,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:50,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:50,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:09:50,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1386957495, now seen corresponding path program 1 times [2022-04-27 23:09:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:50,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739522657] [2022-04-27 23:09:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:09:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:51,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {274#true} is VALID [2022-04-27 23:09:51,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:09:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:51,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {274#true} is VALID [2022-04-27 23:09:51,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:09:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:09:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:51,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {274#true} is VALID [2022-04-27 23:09:51,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:09:51,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:09:51,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {274#true} is VALID [2022-04-27 23:09:51,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {274#true} is VALID [2022-04-27 23:09:51,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:09:51,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {274#true} is VALID [2022-04-27 23:09:51,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {274#true} {274#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:09:51,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {274#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:09:51,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {274#true} is VALID [2022-04-27 23:09:51,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:09:51,051 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {274#true} {274#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:09:51,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:09:51,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:09:51,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:09:51,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:09:51,056 INFO L272 TraceCheckUtils]: 20: Hoare triple {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {289#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:09:51,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {289#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: 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] {290#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:09:51,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {290#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: 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[] {275#false} is VALID [2022-04-27 23:09:51,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:09:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:09:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:51,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739522657] [2022-04-27 23:09:51,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739522657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:09:51,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:09:51,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:09:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454880027] [2022-04-27 23:09:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:09:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 23:09:51,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:51,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:09:51,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:51,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:09:51,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:51,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:09:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:09:51,081 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:09:56,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:01,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:04,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:06,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:08,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:11,140 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-27 23:10:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:10:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 23:10:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 23:10:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 23:10:11,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-27 23:10:11,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:11,476 INFO L225 Difference]: With dead ends: 68 [2022-04-27 23:10:11,477 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 23:10:11,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:10:11,478 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 55 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:11,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 52 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 183 Invalid, 5 Unknown, 0 Unchecked, 14.6s Time] [2022-04-27 23:10:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 23:10:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 23:10:11,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:11,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:11,495 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:11,496 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:11,499 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 23:10:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 23:10:11,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:11,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:11,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 23:10:11,501 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 23:10:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:11,505 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 23:10:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 23:10:11,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:11,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:11,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:11,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 23:10:11,510 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 23:10:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:11,510 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 23:10:11,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 23:10:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 23:10:11,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:11,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:10:11,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 23:10:11,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash -472493455, now seen corresponding path program 1 times [2022-04-27 23:10:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:11,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169477961] [2022-04-27 23:10:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:10:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:11,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {582#true} is VALID [2022-04-27 23:10:11,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:10:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:11,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {582#true} is VALID [2022-04-27 23:10:11,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:10:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:10:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:11,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {582#true} is VALID [2022-04-27 23:10:11,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:10:11,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:10:11,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {582#true} is VALID [2022-04-27 23:10:11,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {582#true} is VALID [2022-04-27 23:10:11,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:10:11,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {582#true} is VALID [2022-04-27 23:10:11,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,762 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {582#true} {582#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:10:11,762 INFO L272 TraceCheckUtils]: 11: Hoare triple {582#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:10:11,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {582#true} is VALID [2022-04-27 23:10:11,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:10:11,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {582#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:10:11,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:11,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:11,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:11,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:11,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:11,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:11,773 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:10:11,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {597#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: 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] {598#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:10:11,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {598#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: 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[] {583#false} is VALID [2022-04-27 23:10:11,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {583#false} is VALID [2022-04-27 23:10:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 23:10:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:11,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169477961] [2022-04-27 23:10:11,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169477961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:10:11,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:10:11,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:10:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620204618] [2022-04-27 23:10:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:10:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 23:10:11,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:11,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:11,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:11,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:10:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:10:11,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:10:11,798 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:14,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:29,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:31,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:31,511 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-04-27 23:10:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:10:31,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 23:10:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-27 23:10:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-27 23:10:31,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-27 23:10:31,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:31,743 INFO L225 Difference]: With dead ends: 77 [2022-04-27 23:10:31,743 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 23:10:31,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:10:31,745 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 78 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:31,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 10.8s Time] [2022-04-27 23:10:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 23:10:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2022-04-27 23:10:31,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:31,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:10:31,774 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:10:31,774 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:10:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:31,779 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 23:10:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 23:10:31,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:31,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:31,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 23:10:31,782 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 23:10:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:31,786 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 23:10:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 23:10:31,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:31,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:31,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:31,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:10:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-27 23:10:31,793 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-27 23:10:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:31,794 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-27 23:10:31,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:10:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-27 23:10:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:10:31,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:31,795 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:10:31,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 23:10:31,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1385093780, now seen corresponding path program 1 times [2022-04-27 23:10:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:31,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442204649] [2022-04-27 23:10:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:31,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:31,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:10:31,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285891875] [2022-04-27 23:10:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:31,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:31,811 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-27 23:10:31,822 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-27 23:10:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:31,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:10:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:31,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:10:32,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {975#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {975#true} is VALID [2022-04-27 23:10:32,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {975#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {975#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {975#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {975#true} is VALID [2022-04-27 23:10:32,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {975#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {975#true} is VALID [2022-04-27 23:10:32,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {975#true} is VALID [2022-04-27 23:10:32,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {975#true} {975#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {975#true} is VALID [2022-04-27 23:10:32,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {975#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {975#true} is VALID [2022-04-27 23:10:32,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {975#true} is VALID [2022-04-27 23:10:32,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {975#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {975#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {975#true} {975#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {975#true} is VALID [2022-04-27 23:10:32,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {975#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:32,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:32,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:32,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:32,104 INFO L272 TraceCheckUtils]: 20: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {975#true} is VALID [2022-04-27 23:10:32,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {975#true} [130] __VERIFIER_assertENTRY-->L12: 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] {975#true} is VALID [2022-04-27 23:10:32,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {975#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {975#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,105 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {975#true} {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:32,105 INFO L272 TraceCheckUtils]: 25: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {975#true} is VALID [2022-04-27 23:10:32,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {975#true} [130] __VERIFIER_assertENTRY-->L12: 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] {975#true} is VALID [2022-04-27 23:10:32,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {975#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {975#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {975#true} is VALID [2022-04-27 23:10:32,107 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {975#true} {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:32,108 INFO L272 TraceCheckUtils]: 30: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1071#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:32,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {1071#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {1075#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:32,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {1075#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {976#false} is VALID [2022-04-27 23:10:32,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {976#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {976#false} is VALID [2022-04-27 23:10:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 23:10:32,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:10:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:32,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442204649] [2022-04-27 23:10:32,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:10:32,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285891875] [2022-04-27 23:10:32,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285891875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:10:32,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:10:32,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:10:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925180583] [2022-04-27 23:10:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:10:32,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 23:10:32,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:32,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:32,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:32,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:10:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:32,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:10:32,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:10:32,142 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:38,238 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-27 23:10:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:10:38,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 23:10:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:10:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:10:38,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 23:10:38,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:38,310 INFO L225 Difference]: With dead ends: 74 [2022-04-27 23:10:38,310 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 23:10:38,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:10:38,311 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:38,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 23:10:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 23:10:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 23:10:38,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:38,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:10:38,325 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:10:38,326 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:10:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:38,329 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 23:10:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 23:10:38,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:38,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:38,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 23:10:38,331 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 23:10:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:38,333 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 23:10:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 23:10:38,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:38,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:38,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:38,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:10:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-27 23:10:38,337 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-27 23:10:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:38,337 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-27 23:10:38,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 23:10:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 23:10:38,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:38,339 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:10:38,343 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-27 23:10:38,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:38,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 419889614, now seen corresponding path program 1 times [2022-04-27 23:10:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:38,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367600446] [2022-04-27 23:10:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:38,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:10:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647026843] [2022-04-27 23:10:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:38,580 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-27 23:10:38,619 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-27 23:10:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:38,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:10:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:38,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:10:38,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {1376#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1376#true} is VALID [2022-04-27 23:10:38,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1376#true} {1376#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {1376#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {1376#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1376#true} {1376#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {1376#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1376#true} is VALID [2022-04-27 23:10:38,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1376#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1376#true} is VALID [2022-04-27 23:10:38,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {1376#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {1376#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,842 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1376#true} {1376#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1376#true} is VALID [2022-04-27 23:10:38,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,845 INFO L272 TraceCheckUtils]: 22: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1376#true} is VALID [2022-04-27 23:10:38,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {1376#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1376#true} is VALID [2022-04-27 23:10:38,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {1376#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,846 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1376#true} {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,846 INFO L272 TraceCheckUtils]: 27: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1376#true} is VALID [2022-04-27 23:10:38,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {1376#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1376#true} is VALID [2022-04-27 23:10:38,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {1376#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {1376#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 23:10:38,847 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1376#true} {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:38,848 INFO L272 TraceCheckUtils]: 32: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:38,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:38,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {1377#false} is VALID [2022-04-27 23:10:38,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#false} is VALID [2022-04-27 23:10:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 23:10:38,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:10:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:38,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367600446] [2022-04-27 23:10:38,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:10:38,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647026843] [2022-04-27 23:10:38,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647026843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:10:38,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:10:38,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:10:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543636329] [2022-04-27 23:10:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:10:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 23:10:38,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:38,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:38,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:38,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:10:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:10:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:10:38,875 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:41,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:43,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:46,716 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-27 23:10:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:10:46,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 23:10:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 23:10:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 23:10:46,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 23:10:46,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:46,789 INFO L225 Difference]: With dead ends: 68 [2022-04-27 23:10:46,789 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 23:10:46,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:10:46,790 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:46,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-04-27 23:10:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 23:10:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 23:10:46,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:46,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:46,808 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:46,808 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:46,812 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 23:10:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 23:10:46,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:46,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:46,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 23:10:46,813 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 23:10:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:46,816 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 23:10:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 23:10:46,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:46,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:46,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:46,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-27 23:10:46,820 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-27 23:10:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:46,821 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-27 23:10:46,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 23:10:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 23:10:46,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:46,822 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:10:46,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 23:10:47,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:47,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1513839050, now seen corresponding path program 1 times [2022-04-27 23:10:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:47,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389419972] [2022-04-27 23:10:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:47,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:10:47,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444992400] [2022-04-27 23:10:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:47,045 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-27 23:10:47,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process