/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/loop-acceleration/simple_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:24:20,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:24:20,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:24:20,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:24:20,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:24:20,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:24:20,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:24:20,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:24:20,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:24:20,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:24:20,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:24:20,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:24:20,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:24:20,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:24:20,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:24:20,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:24:20,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:24:20,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:24:20,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:24:20,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:24:20,857 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:24:20,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:24:20,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:24:20,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:24:20,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:24:20,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:24:20,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:24:20,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:24:20,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:24:20,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:24:20,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:24:20,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:24:20,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:24:20,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:24:20,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:24:20,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:24:20,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:24:20,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:24:20,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:24:20,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:24:20,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:24:20,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:24:20,872 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 21:24:20,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:24:20,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:24:20,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:24:20,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:24:20,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:24:20,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:24:20,892 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:24:20,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:24:20,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:24:20,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:24:20,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:24:20,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:24:20,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:24:20,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:24:20,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:24:20,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:24:20,894 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:24:20,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:24:20,894 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:24:20,894 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 21:24:21,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:24:21,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:24:21,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:24:21,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:24:21,086 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:24:21,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-27 21:24:21,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bf7efee/37bb191e43c446f79c86e72a22ccf827/FLAGe3c5039c8 [2022-04-27 21:24:21,480 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:24:21,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-27 21:24:21,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bf7efee/37bb191e43c446f79c86e72a22ccf827/FLAGe3c5039c8 [2022-04-27 21:24:21,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bf7efee/37bb191e43c446f79c86e72a22ccf827 [2022-04-27 21:24:21,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:24:21,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:24:21,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:24:21,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:24:21,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:24:21,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:24:21" (1/1) ... [2022-04-27 21:24:21,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5331db03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:21, skipping insertion in model container [2022-04-27 21:24:21,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:24:21" (1/1) ... [2022-04-27 21:24:21,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:24:21,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:24:22,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c[322,335] [2022-04-27 21:24:22,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:24:22,142 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:24:22,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c[322,335] [2022-04-27 21:24:22,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:24:22,193 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:24:22,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22 WrapperNode [2022-04-27 21:24:22,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:24:22,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:24:22,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:24:22,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:24:22,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:24:22,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:24:22,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:24:22,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:24:22,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:24:22,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:22,282 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 21:24:22,294 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 21:24:22,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:24:22,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:24:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:24:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:24:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:24:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:24:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:24:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:24:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:24:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:24:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:24:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:24:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:24:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:24:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:24:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:24:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:24:22,362 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:24:22,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:24:22,434 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:24:22,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:24:22,438 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:24:22,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:24:22 BoogieIcfgContainer [2022-04-27 21:24:22,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:24:22,440 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:24:22,440 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:24:22,441 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:24:22,443 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:24:22" (1/1) ... [2022-04-27 21:24:22,444 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:24:22,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:24:22 BasicIcfg [2022-04-27 21:24:22,454 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:24:22,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:24:22,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:24:22,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:24:22,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:24:21" (1/4) ... [2022-04-27 21:24:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7107df6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:24:22, skipping insertion in model container [2022-04-27 21:24:22,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:22" (2/4) ... [2022-04-27 21:24:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7107df6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:24:22, skipping insertion in model container [2022-04-27 21:24:22,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:24:22" (3/4) ... [2022-04-27 21:24:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7107df6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:24:22, skipping insertion in model container [2022-04-27 21:24:22,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:24:22" (4/4) ... [2022-04-27 21:24:22,459 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_4-1.cqvasr [2022-04-27 21:24:22,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:24:22,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:24:22,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:24:22,498 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@2523cbdf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42ab22e [2022-04-27 21:24:22,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:24:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:24:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:24:22,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:22,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:22,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-27 21:24:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028691134] [2022-04-27 21:24:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:22,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:22,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {21#true} is VALID [2022-04-27 21:24:22,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:22,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:22,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:22,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {21#true} is VALID [2022-04-27 21:24:22,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:22,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:22,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:22,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {21#true} is VALID [2022-04-27 21:24:22,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L15-2-->L15-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 21:24:22,723 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {22#false} is VALID [2022-04-27 21:24:22,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L6: 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] {22#false} is VALID [2022-04-27 21:24:22,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L6-->L7: 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[] {22#false} is VALID [2022-04-27 21:24:22,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 21:24:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:22,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028691134] [2022-04-27 21:24:22,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028691134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:24:22,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:24:22,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:24:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343583134] [2022-04-27 21:24:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:24:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:24:22,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:22,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:22,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:24:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:24:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:24:22,774 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:22,840 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 21:24:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:24:22,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:24:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:24:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:24:22,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 21:24:22,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:22,898 INFO L225 Difference]: With dead ends: 29 [2022-04-27 21:24:22,898 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 21:24:22,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:24:22,904 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:22,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:24:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 21:24:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 21:24:22,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:22,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,926 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,926 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:22,928 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 21:24:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:24:22,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:22,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:22,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 21:24:22,929 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 21:24:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:22,930 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 21:24:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:24:22,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:22,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:22,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:22,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 21:24:22,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 21:24:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:22,932 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 21:24:22,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:24:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:24:22,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:22,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:22,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:24:22,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:22,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-27 21:24:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:22,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779996868] [2022-04-27 21:24:22,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:22,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:23,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {110#true} is VALID [2022-04-27 21:24:23,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:23,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:23,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:23,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {110#true} is VALID [2022-04-27 21:24:23,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:23,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:23,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:23,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {115#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} is VALID [2022-04-27 21:24:23,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-27 21:24:23,016 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {111#false} is VALID [2022-04-27 21:24:23,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} [50] __VERIFIER_assertENTRY-->L6: 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] {111#false} is VALID [2022-04-27 21:24:23,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} [51] L6-->L7: 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[] {111#false} is VALID [2022-04-27 21:24:23,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-27 21:24:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:23,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:23,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779996868] [2022-04-27 21:24:23,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779996868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:24:23,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:24:23,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:24:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314618378] [2022-04-27 21:24:23,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:24:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:24:23,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:23,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:23,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:24:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:24:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:24:23,045 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:23,102 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 21:24:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:24:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:24:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 21:24:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 21:24:23,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 21:24:23,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:23,144 INFO L225 Difference]: With dead ends: 18 [2022-04-27 21:24:23,144 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:24:23,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:24:23,146 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:23,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:24:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:24:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:24:23,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:23,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,150 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,150 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:23,151 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:24:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:24:23,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:23,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:23,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:24:23,151 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:24:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:23,152 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:24:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:24:23,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:23,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:23,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:23,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 21:24:23,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 21:24:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:23,153 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 21:24:23,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:24:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:24:23,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:23,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:24:23,154 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-27 21:24:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:23,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39288746] [2022-04-27 21:24:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:23,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {196#true} is VALID [2022-04-27 21:24:23,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:23,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {196#true} is VALID [2022-04-27 21:24:23,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {201#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:23,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {202#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-27 21:24:23,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 21:24:23,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {197#false} is VALID [2022-04-27 21:24:23,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: 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] {197#false} is VALID [2022-04-27 21:24:23,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: 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[] {197#false} is VALID [2022-04-27 21:24:23,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 21:24:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39288746] [2022-04-27 21:24:23,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39288746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525440250] [2022-04-27 21:24:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:23,264 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 21:24:23,279 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 21:24:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:23,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:24:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:23,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:24:23,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [41] 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] {196#true} is VALID [2022-04-27 21:24:23,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {201#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:23,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {225#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:23,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 21:24:23,509 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {197#false} is VALID [2022-04-27 21:24:23,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: 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] {197#false} is VALID [2022-04-27 21:24:23,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: 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[] {197#false} is VALID [2022-04-27 21:24:23,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 21:24:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:23,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:24:23,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 21:24:23,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: 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[] {197#false} is VALID [2022-04-27 21:24:23,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: 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] {197#false} is VALID [2022-04-27 21:24:23,557 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {197#false} is VALID [2022-04-27 21:24:23,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(< 1 (mod main_~x~0 4294967296))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-27 21:24:23,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {253#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-27 21:24:23,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {257#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 21:24:23,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [41] 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] {196#true} is VALID [2022-04-27 21:24:23,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-27 21:24:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:23,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525440250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:24:23,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:24:23,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 21:24:23,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483909711] [2022-04-27 21:24:23,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:24:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:24:23,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:23,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:23,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:24:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:24:23,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:24:23,574 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:23,705 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 21:24:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:24:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:24:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-27 21:24:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-27 21:24:23,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-27 21:24:23,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:23,728 INFO L225 Difference]: With dead ends: 21 [2022-04-27 21:24:23,728 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 21:24:23,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:24:23,729 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:23,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:24:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 21:24:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 21:24:23,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:23,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,737 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,738 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:23,738 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:24:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:24:23,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:23,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:23,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 21:24:23,739 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 21:24:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:23,739 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:24:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:24:23,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:23,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:23,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:23,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 21:24:23,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 21:24:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:23,741 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 21:24:23,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:24:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:24:23,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:23,741 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:23,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:24:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:23,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash 200712928, now seen corresponding path program 2 times [2022-04-27 21:24:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067209725] [2022-04-27 21:24:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:24,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {381#true} is VALID [2022-04-27 21:24:24,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:24,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {381#true} is VALID [2022-04-27 21:24:24,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {381#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {386#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:24,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {387#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:24,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {388#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:24:24,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {389#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:24:24,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {390#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:24:24,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {390#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 21:24:24,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {382#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {382#false} is VALID [2022-04-27 21:24:24,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#false} [50] __VERIFIER_assertENTRY-->L6: 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] {382#false} is VALID [2022-04-27 21:24:24,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {382#false} [51] L6-->L7: 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[] {382#false} is VALID [2022-04-27 21:24:24,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {382#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 21:24:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067209725] [2022-04-27 21:24:24,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067209725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:24,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337591444] [2022-04-27 21:24:24,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:24:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:24,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:24,114 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 21:24:24,131 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 21:24:24,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:24:24,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:24:24,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 21:24:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:24,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:24:24,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [41] 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] {381#true} is VALID [2022-04-27 21:24:24,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {381#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {386#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:24,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {387#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:24,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {388#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:24:24,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {389#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:24:24,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {422#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:24:24,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 21:24:24,255 INFO L272 TraceCheckUtils]: 11: Hoare triple {382#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {382#false} is VALID [2022-04-27 21:24:24,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#false} [50] __VERIFIER_assertENTRY-->L6: 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] {382#false} is VALID [2022-04-27 21:24:24,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {382#false} [51] L6-->L7: 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[] {382#false} is VALID [2022-04-27 21:24:24,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {382#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 21:24:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:24,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:24:24,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {382#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 21:24:24,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {441#(not (<= __VERIFIER_assert_~cond 0))} [51] L6-->L7: 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[] {382#false} is VALID [2022-04-27 21:24:24,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(< 0 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: 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] {441#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:24:24,506 INFO L272 TraceCheckUtils]: 11: Hoare triple {449#(= (mod main_~x~0 2) 0)} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {445#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:24:24,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {453#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {449#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:24:24,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {453#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:24,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {457#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:24,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {461#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:24,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {465#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:24,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {469#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:24,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {381#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [41] 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] {381#true} is VALID [2022-04-27 21:24:24,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 21:24:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:24,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337591444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:24:24,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:24:24,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2022-04-27 21:24:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155113156] [2022-04-27 21:24:24,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:24:24,515 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:24:24,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:24,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:24,537 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 21:24:24,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 21:24:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 21:24:24,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-04-27 21:24:24,538 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:25,356 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 21:24:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:24:25,356 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:24:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2022-04-27 21:24:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2022-04-27 21:24:25,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 35 transitions. [2022-04-27 21:24:25,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:25,404 INFO L225 Difference]: With dead ends: 30 [2022-04-27 21:24:25,404 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 21:24:25,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2022-04-27 21:24:25,405 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:25,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:24:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 21:24:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 21:24:25,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:25,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,447 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,447 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:25,448 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 21:24:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 21:24:25,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:25,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:25,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 21:24:25,449 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 21:24:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:25,449 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 21:24:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 21:24:25,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:25,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:25,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:25,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-27 21:24:25,451 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2022-04-27 21:24:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:25,451 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-27 21:24:25,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 21:24:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:24:25,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:25,451 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:25,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:24:25,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:24:25,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 270494400, now seen corresponding path program 3 times [2022-04-27 21:24:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130486289] [2022-04-27 21:24:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:25,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {652#true} is VALID [2022-04-27 21:24:25,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:25,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {652#true} {652#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:25,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {652#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:25,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {652#true} is VALID [2022-04-27 21:24:25,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:25,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:25,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {652#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:25,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {657#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:25,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {657#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {658#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:25,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {659#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:24:25,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {660#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:24:25,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {661#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:24:25,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {661#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {662#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-27 21:24:25,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {662#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {663#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-27 21:24:25,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {663#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {664#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-27 21:24:25,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {665#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-27 21:24:25,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {665#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {666#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-27 21:24:25,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {666#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {667#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-27 21:24:25,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {667#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {653#false} is VALID [2022-04-27 21:24:25,869 INFO L272 TraceCheckUtils]: 17: Hoare triple {653#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {653#false} is VALID [2022-04-27 21:24:25,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#false} [50] __VERIFIER_assertENTRY-->L6: 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] {653#false} is VALID [2022-04-27 21:24:25,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#false} [51] L6-->L7: 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[] {653#false} is VALID [2022-04-27 21:24:25,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#false} is VALID [2022-04-27 21:24:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:25,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130486289] [2022-04-27 21:24:25,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130486289] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224561516] [2022-04-27 21:24:25,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:24:25,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:25,871 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 21:24:25,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 21:24:25,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 21:24:25,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:24:25,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 21:24:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:25,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:24:26,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {652#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} [41] 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] {652#true} is VALID [2022-04-27 21:24:26,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {652#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {657#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:26,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {657#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {658#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:26,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {659#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:24:26,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {660#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:24:26,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {661#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:24:26,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {661#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {662#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-27 21:24:26,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {662#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {663#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-27 21:24:26,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {663#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {664#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-27 21:24:26,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {665#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-27 21:24:26,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {665#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {666#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-27 21:24:26,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {666#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {717#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-27 21:24:26,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {717#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {653#false} is VALID [2022-04-27 21:24:26,071 INFO L272 TraceCheckUtils]: 17: Hoare triple {653#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {653#false} is VALID [2022-04-27 21:24:26,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#false} [50] __VERIFIER_assertENTRY-->L6: 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] {653#false} is VALID [2022-04-27 21:24:26,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#false} [51] L6-->L7: 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[] {653#false} is VALID [2022-04-27 21:24:26,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#false} is VALID [2022-04-27 21:24:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:26,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:24:26,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#false} is VALID [2022-04-27 21:24:26,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {736#(not (<= __VERIFIER_assert_~cond 0))} [51] L6-->L7: 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[] {653#false} is VALID [2022-04-27 21:24:26,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {740#(< 0 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: 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] {736#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:24:26,446 INFO L272 TraceCheckUtils]: 17: Hoare triple {744#(= (mod main_~x~0 2) 0)} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {740#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:24:26,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {748#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {744#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:24:26,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {752#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {748#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {756#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {752#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {756#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {760#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {768#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {764#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {768#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {772#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {776#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {780#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {784#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {788#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:26,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {652#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} [41] 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] {652#true} is VALID [2022-04-27 21:24:26,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {652#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#true} is VALID [2022-04-27 21:24:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:26,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224561516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:24:26,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:24:26,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 29 [2022-04-27 21:24:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381732099] [2022-04-27 21:24:26,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:24:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 21:24:26,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:26,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:26,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:26,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 21:24:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:26,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 21:24:26,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-04-27 21:24:26,487 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:44,036 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-27 21:24:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 21:24:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 21:24:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2022-04-27 21:24:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2022-04-27 21:24:44,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 53 transitions. [2022-04-27 21:24:45,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:45,189 INFO L225 Difference]: With dead ends: 42 [2022-04-27 21:24:45,189 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 21:24:45,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=722, Invalid=2248, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 21:24:45,191 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:45,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 101 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 21:24:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 21:24:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 21:24:45,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:45,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:45,270 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:45,270 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:45,271 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 21:24:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 21:24:45,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:45,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:45,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 21:24:45,272 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 21:24:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:45,273 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 21:24:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 21:24:45,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:45,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:45,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:45,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-27 21:24:45,274 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2022-04-27 21:24:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:45,275 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-27 21:24:45,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 21:24:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 21:24:45,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:45,275 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:45,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 21:24:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:45,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash 749126272, now seen corresponding path program 4 times [2022-04-27 21:24:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:45,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124080857] [2022-04-27 21:24:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:45,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {1067#true} is VALID [2022-04-27 21:24:45,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:45,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1067#true} {1067#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {1067#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:46,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {1067#true} is VALID [2022-04-27 21:24:46,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1067#true} {1067#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {1067#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1072#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:46,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {1072#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1073#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:46,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {1073#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1074#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:24:46,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1075#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:24:46,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1075#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1076#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:24:46,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1077#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-27 21:24:46,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1078#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-27 21:24:46,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1079#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-27 21:24:46,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1080#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-27 21:24:46,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1081#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-27 21:24:46,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {1081#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1082#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-27 21:24:46,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {1082#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1083#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-27 21:24:46,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {1083#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1084#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-27 21:24:46,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {1084#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1085#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-27 21:24:46,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {1085#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1086#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-27 21:24:46,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {1086#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1087#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-27 21:24:46,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {1087#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1088#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-27 21:24:46,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {1088#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1089#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-27 21:24:46,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {1089#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1090#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-27 21:24:46,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {1090#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1091#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-27 21:24:46,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {1091#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1092#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-27 21:24:46,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {1092#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1093#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-27 21:24:46,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {1093#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1094#(and (<= (div main_~x~0 4294967296) 0) (<= 268435397 main_~x~0))} is VALID [2022-04-27 21:24:46,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#(and (<= (div main_~x~0 4294967296) 0) (<= 268435397 main_~x~0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1068#false} is VALID [2022-04-27 21:24:46,031 INFO L272 TraceCheckUtils]: 29: Hoare triple {1068#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1068#false} is VALID [2022-04-27 21:24:46,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {1068#false} [50] __VERIFIER_assertENTRY-->L6: 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] {1068#false} is VALID [2022-04-27 21:24:46,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {1068#false} [51] L6-->L7: 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[] {1068#false} is VALID [2022-04-27 21:24:46,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {1068#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1068#false} is VALID [2022-04-27 21:24:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:46,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124080857] [2022-04-27 21:24:46,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124080857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:46,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715834194] [2022-04-27 21:24:46,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 21:24:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:46,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:24:46,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 21:24:46,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 21:24:46,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:24:46,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 21:24:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:46,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:24:46,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {1067#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} [41] 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] {1067#true} is VALID [2022-04-27 21:24:46,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1067#true} {1067#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {1067#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:46,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1072#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:24:46,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {1072#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1073#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:24:46,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1073#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1074#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:24:46,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1075#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:24:46,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1075#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1076#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:24:46,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1077#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-27 21:24:46,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1078#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-27 21:24:46,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1079#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-27 21:24:46,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1080#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-27 21:24:46,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1081#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-27 21:24:46,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1081#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1082#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-27 21:24:46,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {1082#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1083#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-27 21:24:46,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {1083#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1084#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-27 21:24:46,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {1084#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1085#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-27 21:24:46,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1085#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1086#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-27 21:24:46,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1086#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1087#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-27 21:24:46,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {1087#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1088#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-27 21:24:46,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {1088#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1089#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-27 21:24:46,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {1089#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1090#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-27 21:24:46,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {1090#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1091#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-27 21:24:46,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {1091#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1092#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-27 21:24:46,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {1092#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1093#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-27 21:24:46,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {1093#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1180#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-27 21:24:46,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {1180#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1068#false} is VALID [2022-04-27 21:24:46,496 INFO L272 TraceCheckUtils]: 29: Hoare triple {1068#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1068#false} is VALID [2022-04-27 21:24:46,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {1068#false} [50] __VERIFIER_assertENTRY-->L6: 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] {1068#false} is VALID [2022-04-27 21:24:46,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {1068#false} [51] L6-->L7: 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[] {1068#false} is VALID [2022-04-27 21:24:46,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {1068#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1068#false} is VALID [2022-04-27 21:24:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:46,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:24:47,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {1068#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1068#false} is VALID [2022-04-27 21:24:47,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {1068#false} [51] L6-->L7: 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[] {1068#false} is VALID [2022-04-27 21:24:47,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {1068#false} [50] __VERIFIER_assertENTRY-->L6: 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] {1068#false} is VALID [2022-04-27 21:24:47,392 INFO L272 TraceCheckUtils]: 29: Hoare triple {1068#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1068#false} is VALID [2022-04-27 21:24:47,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {1208#(< 1 (mod main_~x~0 4294967296))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1068#false} is VALID [2022-04-27 21:24:47,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1208#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-27 21:24:47,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {1216#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1212#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 21:24:47,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {1220#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1216#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {1224#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1220#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {1228#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1224#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {1232#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1228#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-27 21:24:47,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {1236#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1232#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-27 21:24:47,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1236#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {1244#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1240#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-27 21:24:47,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {1248#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1244#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-27 21:24:47,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1248#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {1256#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1252#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {1260#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1256#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {1264#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1260#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-27 21:24:47,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1268#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1264#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-27 21:24:47,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {1272#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1268#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-27 21:24:47,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {1276#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1272#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-27 21:24:47,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1276#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-27 21:24:47,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {1284#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1280#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1284#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-27 21:24:47,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {1292#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1288#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-27 21:24:47,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1292#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-27 21:24:47,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1296#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-27 21:24:47,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1067#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:47,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1067#true} {1067#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:47,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:47,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} [41] 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] {1067#true} is VALID [2022-04-27 21:24:47,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {1067#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#true} is VALID [2022-04-27 21:24:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:47,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715834194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:24:47,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:24:47,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 21:24:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779827554] [2022-04-27 21:24:47,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:24:47,413 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 21:24:47,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:47,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:47,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:47,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 21:24:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 21:24:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 21:24:47,460 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:58,730 WARN L232 SmtUtils]: Spent 52.83s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:26:00,754 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 21:26:55,070 WARN L232 SmtUtils]: Spent 36.88s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:27:38,313 WARN L232 SmtUtils]: Spent 29.51s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:28:07,292 WARN L232 SmtUtils]: Spent 23.21s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:28:47,430 WARN L232 SmtUtils]: Spent 28.87s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:29:22,498 WARN L232 SmtUtils]: Spent 21.95s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:29:47,807 WARN L232 SmtUtils]: Spent 15.25s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:30:00,693 WARN L232 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:30:13,920 WARN L232 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:30:26,185 WARN L232 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:30:35,775 WARN L232 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:31:56,568 WARN L232 SmtUtils]: Spent 45.73s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:32:00,592 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 21:32:02,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:32:06,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:32:08,099 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 21:32:10,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:32:16,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:32:22,801 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 21:32:29,634 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 21:32:34,609 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 21:32:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:32:39,184 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2022-04-27 21:32:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-27 21:32:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 21:32:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:32:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 86 transitions. [2022-04-27 21:32:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 86 transitions. [2022-04-27 21:32:39,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 86 transitions. [2022-04-27 21:32:47,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:32:47,319 INFO L225 Difference]: With dead ends: 63 [2022-04-27 21:32:47,319 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 21:32:47,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 420.4s TimeCoverageRelationStatistics Valid=2492, Invalid=6819, Unknown=1, NotChecked=0, Total=9312 [2022-04-27 21:32:47,321 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 134 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:32:47,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 662 Invalid, 7 Unknown, 0 Unchecked, 28.0s Time] [2022-04-27 21:32:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 21:32:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 21:32:47,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:32:47,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:47,613 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:47,613 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:32:47,616 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 21:32:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 21:32:47,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:32:47,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:32:47,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 21:32:47,617 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 21:32:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:32:47,621 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 21:32:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 21:32:47,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:32:47,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:32:47,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:32:47,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:32:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-27 21:32:47,626 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 33 [2022-04-27 21:32:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:32:47,627 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-27 21:32:47,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:32:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 21:32:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 21:32:47,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:32:47,630 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:32:47,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 21:32:47,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:32:47,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:32:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:32:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1712624128, now seen corresponding path program 5 times [2022-04-27 21:32:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:32:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708094756] [2022-04-27 21:32:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:32:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:32:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:32:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:32:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:32:49,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {1808#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {1756#true} is VALID [2022-04-27 21:32:49,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {1756#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1756#true} is VALID [2022-04-27 21:32:49,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1756#true} {1756#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1756#true} is VALID [2022-04-27 21:32:49,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {1756#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1808#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:32:49,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {1808#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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] {1756#true} is VALID [2022-04-27 21:32:49,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {1756#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1756#true} is VALID [2022-04-27 21:32:49,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1756#true} {1756#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1756#true} is VALID [2022-04-27 21:32:49,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {1756#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1756#true} is VALID [2022-04-27 21:32:49,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {1756#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435441) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1761#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-27 21:32:49,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {1761#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1762#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-27 21:32:49,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {1762#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1763#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-27 21:32:49,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {1763#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1764#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-27 21:32:49,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {1764#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1765#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-27 21:32:49,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {1765#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1766#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-27 21:32:49,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {1766#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1767#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-27 21:32:49,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1768#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-27 21:32:49,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {1768#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1769#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-27 21:32:49,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1770#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-27 21:32:49,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {1770#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1771#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-27 21:32:49,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {1771#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1772#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-27 21:32:49,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {1772#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1773#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-27 21:32:49,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {1773#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1774#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-27 21:32:49,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {1774#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1775#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-27 21:32:49,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1776#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-27 21:32:49,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1777#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-27 21:32:49,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {1777#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1778#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-27 21:32:49,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {1778#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1779#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-27 21:32:49,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {1779#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1780#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-27 21:32:49,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1780#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1781#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-27 21:32:49,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {1781#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1782#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-27 21:32:49,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {1782#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1783#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-27 21:32:49,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {1783#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1784#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-27 21:32:49,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1785#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-27 21:32:49,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {1785#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1786#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-27 21:32:49,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {1786#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1787#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-27 21:32:49,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1788#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-27 21:32:49,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {1788#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1789#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-27 21:32:49,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {1789#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1790#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-27 21:32:49,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {1790#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1791#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-27 21:32:49,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {1791#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1792#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-27 21:32:49,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {1792#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1793#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-27 21:32:49,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {1793#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1794#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-27 21:32:49,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {1794#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1795#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-27 21:32:49,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {1795#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1796#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-27 21:32:49,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {1796#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1797#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-27 21:32:49,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {1797#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1798#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-27 21:32:49,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {1798#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1799#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-27 21:32:49,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {1799#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1800#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-27 21:32:49,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {1800#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1801#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-27 21:32:49,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {1801#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1802#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-27 21:32:49,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {1802#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1803#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-27 21:32:49,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {1803#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1804#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-27 21:32:49,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {1804#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1805#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-27 21:32:49,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {1805#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1806#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-27 21:32:49,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {1806#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} [47] L15-2-->L15-2: Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 1 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {1807#(and (<= (div main_~x~0 4294967296) 0) (<= 268435349 main_~x~0))} is VALID [2022-04-27 21:32:49,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {1807#(and (<= (div main_~x~0 4294967296) 0) (<= 268435349 main_~x~0))} [46] L15-2-->L15-3: Formula: (not (< 1 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1757#false} is VALID [2022-04-27 21:32:49,234 INFO L272 TraceCheckUtils]: 53: Hoare triple {1757#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1757#false} is VALID [2022-04-27 21:32:49,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {1757#false} [50] __VERIFIER_assertENTRY-->L6: 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] {1757#false} is VALID [2022-04-27 21:32:49,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {1757#false} [51] L6-->L7: 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[] {1757#false} is VALID [2022-04-27 21:32:49,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {1757#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1757#false} is VALID [2022-04-27 21:32:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:32:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:32:49,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708094756] [2022-04-27 21:32:49,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708094756] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:32:49,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163800972] [2022-04-27 21:32:49,236 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 21:32:49,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:32:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:32:49,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:32:49,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process