/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 20:21:15,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 20:21:15,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 20:21:15,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 20:21:15,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 20:21:15,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 20:21:15,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 20:21:15,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 20:21:15,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 20:21:15,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 20:21:15,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 20:21:15,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 20:21:15,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 20:21:15,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 20:21:15,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 20:21:15,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 20:21:15,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 20:21:15,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 20:21:15,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 20:21:15,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 20:21:15,622 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 20:21:15,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 20:21:15,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 20:21:15,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 20:21:15,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 20:21:15,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 20:21:15,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 20:21:15,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 20:21:15,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 20:21:15,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 20:21:15,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 20:21:15,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 20:21:15,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 20:21:15,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 20:21:15,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 20:21:15,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 20:21:15,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 20:21:15,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 20:21:15,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 20:21:15,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 20:21:15,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 20:21:15,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 20:21:15,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 20:21:15,644 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 20:21:15,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 20:21:15,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 20:21:15,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 20:21:15,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 20:21:15,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 20:21:15,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 20:21:15,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 20:21:15,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 20:21:15,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 20:21:15,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 20:21:15,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 20:21:15,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 20:21:15,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 20:21:15,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 20:21:15,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 20:21:15,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 20:21:15,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 20:21:15,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:21:15,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 20:21:15,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 20:21:15,648 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 20:21:15,648 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 20:21:15,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 20:21:15,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 20:21:15,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 20:21:15,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 20:21:15,818 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 20:21:15,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c [2022-04-07 20:21:15,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb91be0f/5182bd4a20564f2283903fa4d9afd814/FLAG46db0347e [2022-04-07 20:21:16,193 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 20:21:16,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c [2022-04-07 20:21:16,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb91be0f/5182bd4a20564f2283903fa4d9afd814/FLAG46db0347e [2022-04-07 20:21:16,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb91be0f/5182bd4a20564f2283903fa4d9afd814 [2022-04-07 20:21:16,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 20:21:16,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 20:21:16,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 20:21:16,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 20:21:16,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 20:21:16,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23689d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16, skipping insertion in model container [2022-04-07 20:21:16,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 20:21:16,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 20:21:16,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c[537,550] [2022-04-07 20:21:16,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:21:16,812 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 20:21:16,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c[537,550] [2022-04-07 20:21:16,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:21:16,832 INFO L208 MainTranslator]: Completed translation [2022-04-07 20:21:16,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16 WrapperNode [2022-04-07 20:21:16,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 20:21:16,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 20:21:16,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 20:21:16,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 20:21:16,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 20:21:16,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 20:21:16,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 20:21:16,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 20:21:16,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (1/1) ... [2022-04-07 20:21:16,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:21:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:21:16,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 20:21:16,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 20:21:16,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 20:21:16,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 20:21:16,914 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 20:21:16,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 20:21:16,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 20:21:16,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 20:21:16,914 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 20:21:16,914 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 20:21:16,914 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 20:21:16,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 20:21:16,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 20:21:16,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 20:21:16,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 20:21:16,953 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 20:21:16,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 20:21:17,064 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 20:21:17,069 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 20:21:17,069 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 20:21:17,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:21:17 BoogieIcfgContainer [2022-04-07 20:21:17,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 20:21:17,071 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 20:21:17,071 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 20:21:17,071 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 20:21:17,073 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:21:17" (1/1) ... [2022-04-07 20:21:17,075 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 20:21:17,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:21:17 BasicIcfg [2022-04-07 20:21:17,093 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 20:21:17,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 20:21:17,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 20:21:17,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 20:21:17,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:21:16" (1/4) ... [2022-04-07 20:21:17,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:21:17, skipping insertion in model container [2022-04-07 20:21:17,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:21:16" (2/4) ... [2022-04-07 20:21:17,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:21:17, skipping insertion in model container [2022-04-07 20:21:17,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:21:17" (3/4) ... [2022-04-07 20:21:17,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:21:17, skipping insertion in model container [2022-04-07 20:21:17,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:21:17" (4/4) ... [2022-04-07 20:21:17,099 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound10.cJordan [2022-04-07 20:21:17,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 20:21:17,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 20:21:17,150 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 20:21:17,154 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 20:21:17,154 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 20:21:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 20:21:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 20:21:17,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:21:17,178 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:21:17,179 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:21:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:21:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -293305999, now seen corresponding path program 1 times [2022-04-07 20:21:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:21:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664327662] [2022-04-07 20:21:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:17,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:21:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 20:21:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {35#true} is VALID [2022-04-07 20:21:17,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-07 20:21:17,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-07 20:21:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 20:21:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-07 20:21:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 20:21:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-07 20:21:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 20:21:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-07 20:21:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 20:21:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-07 20:21:17,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 20:21:17,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {35#true} is VALID [2022-04-07 20:21:17,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-07 20:21:17,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-07 20:21:17,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-07 20:21:17,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {35#true} is VALID [2022-04-07 20:21:17,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#true} is VALID [2022-04-07 20:21:17,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-07 20:21:17,400 INFO L272 TraceCheckUtils]: 11: Hoare triple {36#false} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-07 20:21:17,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36#false} {36#false} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-07 20:21:17,402 INFO L272 TraceCheckUtils]: 16: Hoare triple {36#false} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#true} is VALID [2022-04-07 20:21:17,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,403 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36#false} {36#false} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID [2022-04-07 20:21:17,403 INFO L272 TraceCheckUtils]: 21: Hoare triple {36#false} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-07 20:21:17,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-07 20:21:17,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,408 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36#false} {36#false} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-07 20:21:17,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {36#false} is VALID [2022-04-07 20:21:17,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} [91] L42-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,411 INFO L272 TraceCheckUtils]: 28: Hoare triple {36#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {36#false} is VALID [2022-04-07 20:21:17,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {36#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {36#false} is VALID [2022-04-07 20:21:17,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-07 20:21:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 20:21:17,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:21:17,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664327662] [2022-04-07 20:21:17,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664327662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:21:17,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:21:17,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 20:21:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866339557] [2022-04-07 20:21:17,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:21:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-07 20:21:17,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:21:17,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:17,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:17,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 20:21:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:21:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 20:21:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:21:17,484 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:17,584 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 20:21:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 20:21:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-07 20:21:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:21:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-07 20:21:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-07 20:21:17,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-07 20:21:17,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:17,667 INFO L225 Difference]: With dead ends: 33 [2022-04-07 20:21:17,668 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 20:21:17,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:21:17,671 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:21:17,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:21:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 20:21:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-07 20:21:17,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:21:17,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:17,698 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:17,699 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:17,708 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-07 20:21:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-07 20:21:17,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:17,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:17,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-04-07 20:21:17,709 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-04-07 20:21:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:17,711 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-07 20:21:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-07 20:21:17,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:17,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:17,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:21:17,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:21:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-07 20:21:17,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2022-04-07 20:21:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:21:17,727 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-07 20:21:17,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-07 20:21:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 20:21:17,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:21:17,729 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:21:17,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 20:21:17,730 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:21:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:21:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1648116036, now seen corresponding path program 1 times [2022-04-07 20:21:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:21:17,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190017238] [2022-04-07 20:21:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:17,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:21:17,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:21:17,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246007560] [2022-04-07 20:21:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:17,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:21:17,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:21:17,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:21:17,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 20:21:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 20:21:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:17,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:21:18,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {175#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-07 20:21:18,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#(<= ~counter~0 0)} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#(<= ~counter~0 0)} {175#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#(<= ~counter~0 0)} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#(<= ~counter~0 0)} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {183#(<= ~counter~0 0)} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {183#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183#(<= ~counter~0 0)} {183#(<= ~counter~0 0)} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {183#(<= ~counter~0 0)} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,020 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183#(<= ~counter~0 0)} {183#(<= ~counter~0 0)} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,021 INFO L272 TraceCheckUtils]: 16: Hoare triple {183#(<= ~counter~0 0)} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {183#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {183#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {183#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,022 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {183#(<= ~counter~0 0)} {183#(<= ~counter~0 0)} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,023 INFO L272 TraceCheckUtils]: 21: Hoare triple {183#(<= ~counter~0 0)} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {183#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {183#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {183#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,026 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {183#(<= ~counter~0 0)} {183#(<= ~counter~0 0)} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {183#(<= ~counter~0 0)} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {183#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:18,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {183#(<= ~counter~0 0)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {262#(<= |main_#t~post6| 0)} is VALID [2022-04-07 20:21:18,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {262#(<= |main_#t~post6| 0)} [94] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {176#false} is VALID [2022-04-07 20:21:18,028 INFO L272 TraceCheckUtils]: 29: Hoare triple {176#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {176#false} is VALID [2022-04-07 20:21:18,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {176#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {176#false} is VALID [2022-04-07 20:21:18,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {176#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-07 20:21:18,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {176#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-07 20:21:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 20:21:18,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:21:18,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:21:18,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190017238] [2022-04-07 20:21:18,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:21:18,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246007560] [2022-04-07 20:21:18,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246007560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:21:18,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:21:18,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 20:21:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269074207] [2022-04-07 20:21:18,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:21:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 20:21:18,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:21:18,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:18,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:18,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 20:21:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:21:18,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 20:21:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:21:18,056 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:18,125 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 20:21:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 20:21:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 20:21:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:21:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-07 20:21:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-07 20:21:18,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-07 20:21:18,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:18,163 INFO L225 Difference]: With dead ends: 29 [2022-04-07 20:21:18,163 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 20:21:18,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:21:18,169 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:21:18,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:21:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 20:21:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 20:21:18,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:21:18,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:18,179 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:18,179 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:18,181 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 20:21:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 20:21:18,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:18,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:18,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 20:21:18,182 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 20:21:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:18,184 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 20:21:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 20:21:18,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:18,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:18,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:21:18,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:21:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:21:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-07 20:21:18,186 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33 [2022-04-07 20:21:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:21:18,186 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-07 20:21:18,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 20:21:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 20:21:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 20:21:18,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:21:18,187 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:21:18,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 20:21:18,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:21:18,388 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:21:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:21:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1647043560, now seen corresponding path program 1 times [2022-04-07 20:21:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:21:18,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612855841] [2022-04-07 20:21:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:21:18,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:21:18,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196347864] [2022-04-07 20:21:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:21:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:21:18,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:21:18,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 20:21:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:18,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-07 20:21:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:18,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:21:18,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {393#true} is VALID [2022-04-07 20:21:18,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {393#true} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {393#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {393#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {393#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {393#true} {393#true} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {393#true} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {393#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {393#true} is VALID [2022-04-07 20:21:18,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {393#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {393#true} {393#true} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L272 TraceCheckUtils]: 16: Hoare triple {393#true} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {393#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {393#true} {393#true} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {393#true} is VALID [2022-04-07 20:21:18,935 INFO L272 TraceCheckUtils]: 21: Hoare triple {393#true} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {393#true} is VALID [2022-04-07 20:21:18,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {393#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {393#true} is VALID [2022-04-07 20:21:18,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {393#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {393#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 20:21:18,936 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {393#true} {393#true} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {393#true} is VALID [2022-04-07 20:21:18,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {393#true} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {476#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 20:21:18,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {476#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {476#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 20:21:18,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {476#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [95] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {476#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 20:21:18,939 INFO L272 TraceCheckUtils]: 29: Hoare triple {476#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [98] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {486#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 20:21:18,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {486#(= |__VERIFIER_assert_#in~cond| 1)} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:21:18,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 20:21:18,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {394#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 20:21:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 20:21:18,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:21:18,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:21:18,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612855841] [2022-04-07 20:21:18,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:21:18,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196347864] [2022-04-07 20:21:18,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196347864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:21:18,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:21:18,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 20:21:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400367527] [2022-04-07 20:21:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:21:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-07 20:21:18,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:21:18,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:21:18,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:18,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:21:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:21:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:21:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 20:21:18,968 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:21:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:19,115 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-07 20:21:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:21:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-07 20:21:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:21:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:21:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 20:21:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:21:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 20:21:19,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-07 20:21:19,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:19,162 INFO L225 Difference]: With dead ends: 37 [2022-04-07 20:21:19,162 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 20:21:19,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 20:21:19,163 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:21:19,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:21:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 20:21:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-07 20:21:19,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:21:19,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:21:19,167 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:21:19,167 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:21:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:19,169 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 20:21:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 20:21:19,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:19,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:19,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 20:21:19,170 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 20:21:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:19,171 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 20:21:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 20:21:19,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:19,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:19,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:21:19,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:21:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:21:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-07 20:21:19,173 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-04-07 20:21:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:21:19,174 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-07 20:21:19,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:21:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-07 20:21:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 20:21:19,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:21:19,175 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:21:19,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 20:21:19,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 20:21:19,388 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:21:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:21:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1112374504, now seen corresponding path program 1 times [2022-04-07 20:21:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:21:19,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671649412] [2022-04-07 20:21:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:21:19,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:21:19,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8018478] [2022-04-07 20:21:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:21:19,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:21:19,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:21:19,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 20:21:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:19,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 20:21:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:21:19,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:21:19,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {642#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#(<= ~counter~0 0)} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#(<= ~counter~0 0)} {642#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#(<= ~counter~0 0)} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#(<= ~counter~0 0)} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {650#(<= ~counter~0 0)} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {650#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {650#(<= ~counter~0 0)} {650#(<= ~counter~0 0)} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,618 INFO L272 TraceCheckUtils]: 11: Hoare triple {650#(<= ~counter~0 0)} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {650#(<= ~counter~0 0)} {650#(<= ~counter~0 0)} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {650#(<= ~counter~0 0)} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {650#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {650#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,622 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {650#(<= ~counter~0 0)} {650#(<= ~counter~0 0)} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,622 INFO L272 TraceCheckUtils]: 21: Hoare triple {650#(<= ~counter~0 0)} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#(<= ~counter~0 0)} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {650#(<= ~counter~0 0)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {650#(<= ~counter~0 0)} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,623 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {650#(<= ~counter~0 0)} {650#(<= ~counter~0 0)} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {650#(<= ~counter~0 0)} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {650#(<= ~counter~0 0)} is VALID [2022-04-07 20:21:19,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {650#(<= ~counter~0 0)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {729#(<= ~counter~0 1)} [95] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,625 INFO L272 TraceCheckUtils]: 29: Hoare triple {729#(<= ~counter~0 1)} [98] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {729#(<= ~counter~0 1)} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {729#(<= ~counter~0 1)} [101] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {729#(<= ~counter~0 1)} [106] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,627 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {729#(<= ~counter~0 1)} {729#(<= ~counter~0 1)} [115] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {729#(<= ~counter~0 1)} [103] L37-1-->L42: Formula: (not (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {729#(<= ~counter~0 1)} [107] L42-->L42-2: Formula: (and (< (mod v_main_~y~0_1 4294967296) (mod v_main_~x~0_2 4294967296)) (= v_main_~v~0_1 (+ v_main_~u~0_1 v_main_~v~0_2)) (= v_main_~x~0_1 (+ (* (- 1) v_main_~y~0_1) v_main_~x~0_2))) InVars {main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_2, main_~x~0=v_main_~x~0_2, main_~u~0=v_main_~u~0_1} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~x~0=v_main_~x~0_1, main_~u~0=v_main_~u~0_1} AuxVars[] AssignedVars[main_~v~0, main_~x~0] {729#(<= ~counter~0 1)} is VALID [2022-04-07 20:21:19,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {729#(<= ~counter~0 1)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {757#(<= |main_#t~post6| 1)} is VALID [2022-04-07 20:21:19,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {757#(<= |main_#t~post6| 1)} [94] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {643#false} is VALID [2022-04-07 20:21:19,628 INFO L272 TraceCheckUtils]: 38: Hoare triple {643#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {643#false} is VALID [2022-04-07 20:21:19,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {643#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {643#false} is VALID [2022-04-07 20:21:19,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {643#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {643#false} is VALID [2022-04-07 20:21:19,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {643#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#false} is VALID [2022-04-07 20:21:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 20:21:19,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:21:19,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {643#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#false} is VALID [2022-04-07 20:21:19,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {643#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {643#false} is VALID [2022-04-07 20:21:19,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {643#false} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {643#false} is VALID [2022-04-07 20:21:19,815 INFO L272 TraceCheckUtils]: 38: Hoare triple {643#false} [93] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {643#false} is VALID [2022-04-07 20:21:19,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {785#(< |main_#t~post6| 10)} [94] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {643#false} is VALID [2022-04-07 20:21:19,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {789#(< ~counter~0 10)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {785#(< |main_#t~post6| 10)} is VALID [2022-04-07 20:21:19,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {789#(< ~counter~0 10)} [107] L42-->L42-2: Formula: (and (< (mod v_main_~y~0_1 4294967296) (mod v_main_~x~0_2 4294967296)) (= v_main_~v~0_1 (+ v_main_~u~0_1 v_main_~v~0_2)) (= v_main_~x~0_1 (+ (* (- 1) v_main_~y~0_1) v_main_~x~0_2))) InVars {main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_2, main_~x~0=v_main_~x~0_2, main_~u~0=v_main_~u~0_1} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~x~0=v_main_~x~0_1, main_~u~0=v_main_~u~0_1} AuxVars[] AssignedVars[main_~v~0, main_~x~0] {789#(< ~counter~0 10)} is VALID [2022-04-07 20:21:19,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {789#(< ~counter~0 10)} [103] L37-1-->L42: Formula: (not (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] {789#(< ~counter~0 10)} is VALID [2022-04-07 20:21:19,817 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {642#true} {789#(< ~counter~0 10)} [115] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {789#(< ~counter~0 10)} is VALID [2022-04-07 20:21:19,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {642#true} [106] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {642#true} [101] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {642#true} [97] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {642#true} is VALID [2022-04-07 20:21:19,817 INFO L272 TraceCheckUtils]: 29: Hoare triple {789#(< ~counter~0 10)} [98] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {642#true} is VALID [2022-04-07 20:21:19,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {789#(< ~counter~0 10)} [95] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {789#(< ~counter~0 10)} is VALID [2022-04-07 20:21:19,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {817#(< ~counter~0 9)} [92] L42-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {789#(< ~counter~0 10)} is VALID [2022-04-07 20:21:19,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {817#(< ~counter~0 9)} [90] L29-->L42-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,819 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {642#true} {817#(< ~counter~0 9)} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {642#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {642#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {642#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {642#true} is VALID [2022-04-07 20:21:19,828 INFO L272 TraceCheckUtils]: 21: Hoare triple {817#(< ~counter~0 9)} [88] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {642#true} is VALID [2022-04-07 20:21:19,836 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {642#true} {817#(< ~counter~0 9)} [112] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {642#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {642#true} is VALID [2022-04-07 20:21:19,837 INFO L272 TraceCheckUtils]: 16: Hoare triple {817#(< ~counter~0 9)} [85] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {642#true} is VALID [2022-04-07 20:21:19,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {642#true} {817#(< ~counter~0 9)} [111] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {642#true} is VALID [2022-04-07 20:21:19,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {817#(< ~counter~0 9)} [83] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {642#true} is VALID [2022-04-07 20:21:19,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {642#true} {817#(< ~counter~0 9)} [110] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#true} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#true} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {642#true} is VALID [2022-04-07 20:21:19,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {817#(< ~counter~0 9)} [82] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {642#true} is VALID [2022-04-07 20:21:19,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {817#(< ~counter~0 9)} [80] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {817#(< ~counter~0 9)} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {817#(< ~counter~0 9)} {642#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {817#(< ~counter~0 9)} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#true} [78] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {817#(< ~counter~0 9)} is VALID [2022-04-07 20:21:19,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {642#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {642#true} is VALID [2022-04-07 20:21:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 20:21:19,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:21:19,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671649412] [2022-04-07 20:21:19,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:21:19,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8018478] [2022-04-07 20:21:19,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8018478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:21:19,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:21:19,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 20:21:19,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755743680] [2022-04-07 20:21:19,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:21:19,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-07 20:21:19,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:21:19,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-07 20:21:19,902 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-07 20:21:19,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 20:21:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:21:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 20:21:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 20:21:19,903 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-07 20:21:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:20,096 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-07 20:21:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 20:21:20,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-07 20:21:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:21:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-07 20:21:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-07 20:21:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-07 20:21:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-07 20:21:20,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-07 20:21:20,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:21:20,155 INFO L225 Difference]: With dead ends: 62 [2022-04-07 20:21:20,155 INFO L226 Difference]: Without dead ends: 62 [2022-04-07 20:21:20,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 20:21:20,156 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:21:20,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:21:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-07 20:21:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-04-07 20:21:20,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:21:20,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 20:21:20,160 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 20:21:20,160 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 20:21:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:20,162 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-07 20:21:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-07 20:21:20,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:20,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:20,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-07 20:21:20,163 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-07 20:21:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:21:20,165 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-07 20:21:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-07 20:21:20,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:21:20,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:21:20,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:21:20,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:21:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 20:21:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-07 20:21:20,167 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 42 [2022-04-07 20:21:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:21:20,168 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-07 20:21:20,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-07 20:21:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-07 20:21:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 20:21:20,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:21:20,168 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:21:20,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 20:21:20,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:21:20,385 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:21:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:21:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1113446980, now seen corresponding path program 1 times [2022-04-07 20:21:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:21:20,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640061994] [2022-04-07 20:21:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:21:20,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:21:20,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723648886] [2022-04-07 20:21:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:21:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:21:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:21:20,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:21:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process