/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/dijkstra-u_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:42:33,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:42:33,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:42:33,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:42:33,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:42:33,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:42:33,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:42:33,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:42:33,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:42:33,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:42:33,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:42:33,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:42:33,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:42:33,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:42:33,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:42:33,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:42:33,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:42:33,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:42:33,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:42:33,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:42:33,967 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:42:33,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:42:33,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:42:33,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:42:33,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:42:33,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:42:33,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:42:33,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:42:33,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:42:33,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:42:33,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:42:33,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:42:33,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:42:33,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:42:33,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:42:33,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:42:33,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:42:33,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:42:33,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:42:33,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:42:33,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:42:33,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:42:33,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:42:33,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:42:33,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:42:33,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:42:33,999 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:42:33,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:42:33,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:42:33,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:42:34,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:42:34,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:42:34,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:42:34,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:42:34,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:42:34,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:42:34,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:42:34,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:42:34,003 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:42:34,003 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-27 17:42:34,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:42:34,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:42:34,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:42:34,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:42:34,253 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:42:34,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c [2022-04-27 17:42:34,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ffab29c/d53ac11360414b2fb5dcff73455ebfd7/FLAG0804c54b3 [2022-04-27 17:42:34,650 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:42:34,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c [2022-04-27 17:42:34,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ffab29c/d53ac11360414b2fb5dcff73455ebfd7/FLAG0804c54b3 [2022-04-27 17:42:34,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ffab29c/d53ac11360414b2fb5dcff73455ebfd7 [2022-04-27 17:42:34,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:42:34,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:42:34,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:42:34,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:42:34,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:42:34,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:34,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73401039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34, skipping insertion in model container [2022-04-27 17:42:34,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:34,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:42:34,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:42:34,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2022-04-27 17:42:34,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:42:34,934 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:42:34,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2022-04-27 17:42:34,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:42:34,996 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:42:34,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34 WrapperNode [2022-04-27 17:42:34,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:42:34,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:42:34,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:42:34,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:42:35,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:42:35,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:42:35,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:42:35,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:42:35,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (1/1) ... [2022-04-27 17:42:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:42:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:42:35,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 17:42:35,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 17:42:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:42:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:42:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:42:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:42:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:42:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:42:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:42:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:42:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:42:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:42:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:42:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:42:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:42:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:42:35,154 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:42:35,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:42:35,377 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:42:35,383 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:42:35,384 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:42:35,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:42:35 BoogieIcfgContainer [2022-04-27 17:42:35,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:42:35,386 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:42:35,386 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:42:35,387 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:42:35,390 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:42:35" (1/1) ... [2022-04-27 17:42:35,392 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:42:35,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:42:35 BasicIcfg [2022-04-27 17:42:35,421 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:42:35,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:42:35,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:42:35,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:42:35,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:42:34" (1/4) ... [2022-04-27 17:42:35,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc95bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:42:35, skipping insertion in model container [2022-04-27 17:42:35,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:42:34" (2/4) ... [2022-04-27 17:42:35,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc95bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:42:35, skipping insertion in model container [2022-04-27 17:42:35,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:42:35" (3/4) ... [2022-04-27 17:42:35,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc95bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:42:35, skipping insertion in model container [2022-04-27 17:42:35,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:42:35" (4/4) ... [2022-04-27 17:42:35,428 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound10.cJordan [2022-04-27 17:42:35,442 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:42:35,442 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:42:35,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:42:35,484 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22bde9c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62ce6271 [2022-04-27 17:42:35,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:42:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 17:42:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 17:42:35,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:42:35,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:42:35,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:42:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:42:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 890522097, now seen corresponding path program 1 times [2022-04-27 17:42:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:42:35,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809651774] [2022-04-27 17:42:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:42:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:42:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:35,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:42:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:35,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-27 17:42:35,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:42:35,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:42:35,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:42:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:35,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 17:42:35,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:42:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:42:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:35,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 17:42:35,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:42:35,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:42:35,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-27 17:42:35,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:42:35,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:42:35,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:42:35,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {41#true} is VALID [2022-04-27 17:42:35,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 17:42:35,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 17:42:35,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:42:35,784 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 17:42:35,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-27 17:42:35,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,786 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:42:35,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 17:42:35,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} [118] L30-2-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} [122] L52-2-->L38-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,787 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} [127] L38-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_24 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0) (* (* v_main_~n~0_24 .cse0) 4294967295))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_24, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 17:42:35,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-27 17:42:35,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:42:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:42:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:42:35,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809651774] [2022-04-27 17:42:35,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809651774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:42:35,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:42:35,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:42:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273552025] [2022-04-27 17:42:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:42:35,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 17:42:35,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:42:35,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:42:35,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:42:35,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:42:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:42:35,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:42:35,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:42:35,875 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:42:38,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:42:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:42:39,056 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-27 17:42:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:42:39,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 17:42:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:42:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:42:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 17:42:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:42:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 17:42:39,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 17:42:39,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:42:39,163 INFO L225 Difference]: With dead ends: 38 [2022-04-27 17:42:39,163 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 17:42:39,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:42:39,170 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:42:39,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 17:42:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 17:42:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 17:42:39,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:42:39,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:42:39,194 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:42:39,194 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:42:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:42:39,200 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 17:42:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 17:42:39,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:42:39,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:42:39,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 17:42:39,202 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 17:42:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:42:39,207 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 17:42:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 17:42:39,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:42:39,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:42:39,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:42:39,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:42:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:42:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 17:42:39,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 17:42:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:42:39,214 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 17:42:39,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:42:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 17:42:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 17:42:39,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:42:39,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:42:39,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:42:39,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:42:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:42:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1386957495, now seen corresponding path program 1 times [2022-04-27 17:42:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:42:39,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744483255] [2022-04-27 17:42:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:42:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:42:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:42:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:39,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {194#true} is VALID [2022-04-27 17:42:39,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:42:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:39,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID [2022-04-27 17:42:39,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:42:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:42:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:42:39,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID [2022-04-27 17:42:39,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:42:39,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:42:39,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {194#true} is VALID [2022-04-27 17:42:39,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {194#true} is VALID [2022-04-27 17:42:39,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {194#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:42:39,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID [2022-04-27 17:42:39,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {194#true} {194#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:42:39,530 INFO L272 TraceCheckUtils]: 11: Hoare triple {194#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:42:39,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID [2022-04-27 17:42:39,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-27 17:42:39,531 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {194#true} {194#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:42:39,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {194#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 17:42:39,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 17:42:39,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 17:42:39,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 17:42:39,535 INFO L272 TraceCheckUtils]: 20: Hoare triple {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:42:39,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:42:39,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {195#false} is VALID [2022-04-27 17:42:39,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {195#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#false} is VALID [2022-04-27 17:42:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:42:39,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:42:39,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744483255] [2022-04-27 17:42:39,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744483255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:42:39,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:42:39,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 17:42:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327655885] [2022-04-27 17:42:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:42:39,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 17:42:39,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:42:39,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:42:39,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:42:39,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 17:42:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:42:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 17:42:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 17:42:39,567 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:42:42,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:42:44,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:42:46,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:42:51,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:42:54,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:42:57,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:42:59,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:43:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:07,379 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-04-27 17:43:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:43:07,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 17:43:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:43:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-04-27 17:43:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-04-27 17:43:07,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2022-04-27 17:43:07,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:07,644 INFO L225 Difference]: With dead ends: 50 [2022-04-27 17:43:07,644 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 17:43:07,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 17:43:07,645 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 48 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-04-27 17:43:07,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 20.8s Time] [2022-04-27 17:43:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 17:43:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 17:43:07,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:43:07,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 17:43:07,651 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 17:43:07,652 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 17:43:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:07,656 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 17:43:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 17:43:07,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:07,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:07,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 17:43:07,663 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 17:43:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:07,667 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 17:43:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 17:43:07,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:07,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:07,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:43:07,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:43:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 17:43:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 17:43:07,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 17:43:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:43:07,679 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 17:43:07,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 17:43:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 17:43:07,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:43:07,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:43:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:43:07,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:43:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:43:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -472493455, now seen corresponding path program 1 times [2022-04-27 17:43:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:43:07,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738214194] [2022-04-27 17:43:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:43:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:43:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:07,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {418#true} is VALID [2022-04-27 17:43:07,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {418#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {418#true} {418#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:43:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:07,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID [2022-04-27 17:43:07,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:43:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:43:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:07,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID [2022-04-27 17:43:07,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:43:07,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {418#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:43:07,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {418#true} is VALID [2022-04-27 17:43:07,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {418#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {418#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {418#true} is VALID [2022-04-27 17:43:07,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {418#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:43:07,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID [2022-04-27 17:43:07,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {418#true} {418#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:43:07,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {418#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:43:07,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID [2022-04-27 17:43:07,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#true} is VALID [2022-04-27 17:43:07,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {418#true} {418#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:43:07,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 17:43:07,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 17:43:07,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 17:43:07,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 17:43:07,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 17:43:07,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 17:43:07,923 INFO L272 TraceCheckUtils]: 22: Hoare triple {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {433#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:43:07,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {433#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:43:07,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {434#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {419#false} is VALID [2022-04-27 17:43:07,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {419#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#false} is VALID [2022-04-27 17:43:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 17:43:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:43:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738214194] [2022-04-27 17:43:07,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738214194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:43:07,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:43:07,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 17:43:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676795150] [2022-04-27 17:43:07,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:43:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 17:43:07,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:43:07,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:07,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:07,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 17:43:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:43:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 17:43:07,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 17:43:07,948 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:13,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:43:15,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:43:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:21,779 INFO L93 Difference]: Finished difference Result 75 states and 110 transitions. [2022-04-27 17:43:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:43:21,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 17:43:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:43:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-27 17:43:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-27 17:43:21,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-27 17:43:22,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:22,237 INFO L225 Difference]: With dead ends: 75 [2022-04-27 17:43:22,238 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 17:43:22,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 17:43:22,239 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 78 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-27 17:43:22,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 225 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2022-04-27 17:43:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 17:43:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2022-04-27 17:43:22,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:43:22,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:43:22,248 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:43:22,249 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:43:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:22,254 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 17:43:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 17:43:22,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:22,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:22,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 17:43:22,256 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 17:43:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:22,261 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 17:43:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 17:43:22,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:22,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:22,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:43:22,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:43:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:43:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-27 17:43:22,266 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-27 17:43:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:43:22,267 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-27 17:43:22,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:43:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-27 17:43:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 17:43:22,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:43:22,268 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:43:22,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 17:43:22,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:43:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:43:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1385093780, now seen corresponding path program 1 times [2022-04-27 17:43:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:43:22,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102591317] [2022-04-27 17:43:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:43:22,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:43:22,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279700850] [2022-04-27 17:43:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:22,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:43:22,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:43:22,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:43:22,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 17:43:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:22,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:43:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:22,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:43:22,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {728#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {728#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {728#true} is VALID [2022-04-27 17:43:22,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {728#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {728#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {728#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {728#true} is VALID [2022-04-27 17:43:22,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {728#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID [2022-04-27 17:43:22,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {728#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {728#true} is VALID [2022-04-27 17:43:22,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {728#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {728#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {728#true} {728#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID [2022-04-27 17:43:22,696 INFO L272 TraceCheckUtils]: 11: Hoare triple {728#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID [2022-04-27 17:43:22,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {728#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {728#true} is VALID [2022-04-27 17:43:22,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {728#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,696 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {728#true} {728#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID [2022-04-27 17:43:22,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {728#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:43:22,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:43:22,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:43:22,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:43:22,702 INFO L272 TraceCheckUtils]: 20: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {728#true} is VALID [2022-04-27 17:43:22,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {728#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {728#true} is VALID [2022-04-27 17:43:22,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {728#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,704 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {728#true} {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:43:22,704 INFO L272 TraceCheckUtils]: 25: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {728#true} is VALID [2022-04-27 17:43:22,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {728#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {728#true} is VALID [2022-04-27 17:43:22,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {728#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {728#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#true} is VALID [2022-04-27 17:43:22,705 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {728#true} {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:43:22,706 INFO L272 TraceCheckUtils]: 30: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:43:22,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {824#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:43:22,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {828#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {729#false} is VALID [2022-04-27 17:43:22,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {729#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {729#false} is VALID [2022-04-27 17:43:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 17:43:22,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:43:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:43:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102591317] [2022-04-27 17:43:22,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:43:22,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279700850] [2022-04-27 17:43:22,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279700850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:43:22,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:43:22,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:43:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518710983] [2022-04-27 17:43:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:43:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 17:43:22,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:43:22,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:22,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:43:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:43:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:43:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:43:22,737 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:26,981 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-04-27 17:43:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:43:26,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 17:43:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:43:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:43:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:43:26,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 17:43:27,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:27,063 INFO L225 Difference]: With dead ends: 72 [2022-04-27 17:43:27,064 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 17:43:27,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:43:27,065 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 17:43:27,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 17:43:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 17:43:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 17:43:27,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:43:27,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:43:27,071 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:43:27,072 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:43:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:27,075 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 17:43:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 17:43:27,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:27,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:27,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 17:43:27,077 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 17:43:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:27,079 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 17:43:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 17:43:27,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:27,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:27,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:43:27,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:43:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:43:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-27 17:43:27,083 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-27 17:43:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:43:27,084 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-27 17:43:27,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 17:43:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 17:43:27,085 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:43:27,085 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:43:27,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 17:43:27,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:43:27,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:43:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:43:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 419889614, now seen corresponding path program 1 times [2022-04-27 17:43:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:43:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861434205] [2022-04-27 17:43:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:43:27,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:43:27,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930745178] [2022-04-27 17:43:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:27,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:43:27,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:43:27,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:43:27,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 17:43:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:27,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:43:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:27,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:43:27,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1061#true} is VALID [2022-04-27 17:43:27,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {1061#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID [2022-04-27 17:43:27,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID [2022-04-27 17:43:27,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1061#true} is VALID [2022-04-27 17:43:27,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {1061#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1061#true} {1061#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID [2022-04-27 17:43:27,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {1061#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,608 INFO L272 TraceCheckUtils]: 22: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1061#true} is VALID [2022-04-27 17:43:27,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1061#true} is VALID [2022-04-27 17:43:27,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {1061#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {1061#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,610 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1061#true} {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,610 INFO L272 TraceCheckUtils]: 27: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1061#true} is VALID [2022-04-27 17:43:27,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {1061#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1061#true} is VALID [2022-04-27 17:43:27,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {1061#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {1061#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#true} is VALID [2022-04-27 17:43:27,611 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1061#true} {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:43:27,612 INFO L272 TraceCheckUtils]: 32: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:43:27,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1167#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:43:27,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {1167#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1062#false} is VALID [2022-04-27 17:43:27,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {1062#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1062#false} is VALID [2022-04-27 17:43:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 17:43:27,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:43:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:43:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861434205] [2022-04-27 17:43:27,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:43:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930745178] [2022-04-27 17:43:27,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930745178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:43:27,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:43:27,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:43:27,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501095691] [2022-04-27 17:43:27,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:43:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 17:43:27,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:43:27,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:27,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:27,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:43:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:43:27,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:43:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:43:27,642 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:31,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:43:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:36,512 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-04-27 17:43:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:43:36,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 17:43:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:43:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 17:43:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 17:43:36,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 17:43:36,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:43:36,585 INFO L225 Difference]: With dead ends: 66 [2022-04-27 17:43:36,585 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 17:43:36,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:43:36,586 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 17:43:36,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 17:43:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 17:43:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 17:43:36,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:43:36,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:43:36,593 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:43:36,593 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:43:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:36,597 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 17:43:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 17:43:36,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:36,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:36,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 17:43:36,598 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 17:43:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:36,602 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 17:43:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 17:43:36,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:36,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:36,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:43:36,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:43:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:43:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-27 17:43:36,605 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-27 17:43:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:43:36,606 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-27 17:43:36,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:43:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 17:43:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 17:43:36,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:43:36,607 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:43:36,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 17:43:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:43:36,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:43:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:43:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1513839050, now seen corresponding path program 1 times [2022-04-27 17:43:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:43:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57210418] [2022-04-27 17:43:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:43:36,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:43:36,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1988791049] [2022-04-27 17:43:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:43:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:43:36,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:43:36,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process