/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_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:43:50,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:43:50,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:43:50,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:43:50,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:43:50,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:43:50,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:43:50,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:43:50,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:43:50,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:43:50,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:43:50,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:43:50,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:43:50,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:43:50,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:43:50,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:43:50,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:43:50,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:43:50,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:43:50,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:43:50,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:43:50,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:43:50,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:43:50,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:43:50,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:43:50,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:43:50,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:43:50,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:43:50,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:43:50,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:43:50,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:43:50,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:43:50,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:43:50,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:43:50,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:43:50,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:43:50,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:43:50,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:43:50,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:43:50,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:43:50,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:43:50,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:43:50,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:43:50,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:43:50,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:43:50,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:43:50,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:43:50,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:43:50,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:43:50,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:43:50,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:43:50,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:43:50,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:43:50,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:43:50,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:43:50,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:43:50,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:43:50,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:43:50,990 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:43:50,990 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:43:51,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:43:51,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:43:51,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:43:51,199 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:43:51,200 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:43:51,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-27 17:43:51,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea8193aa/f5ba8d01bb5c4e4da10e4252c2feb899/FLAG188e5d6c5 [2022-04-27 17:43:51,584 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:43:51,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-27 17:43:51,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea8193aa/f5ba8d01bb5c4e4da10e4252c2feb899/FLAG188e5d6c5 [2022-04-27 17:43:51,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea8193aa/f5ba8d01bb5c4e4da10e4252c2feb899 [2022-04-27 17:43:51,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:43:51,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:43:51,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:43:51,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:43:51,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:43:51,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a94888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51, skipping insertion in model container [2022-04-27 17:43:51,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:43:51,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:43:51,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2022-04-27 17:43:51,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:43:51,823 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:43:51,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2022-04-27 17:43:51,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:43:51,873 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:43:51,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51 WrapperNode [2022-04-27 17:43:51,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:43:51,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:43:51,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:43:51,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:43:51,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:43:51,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:43:51,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:43:51,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:43:51,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (1/1) ... [2022-04-27 17:43:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:43:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:43:51,928 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:43:51,934 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:43:51,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:43:51,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:43:51,959 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:43:51,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:43:51,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:43:51,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:43:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:43:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:43:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:43:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:43:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 17:43:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:43:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:43:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:43:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:43:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:43:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:43:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:43:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:43:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:43:52,003 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:43:52,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:43:52,197 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:43:52,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:43:52,202 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:43:52,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:43:52 BoogieIcfgContainer [2022-04-27 17:43:52,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:43:52,204 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:43:52,204 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:43:52,205 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:43:52,219 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:43:52" (1/1) ... [2022-04-27 17:43:52,220 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:43:52,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:43:52 BasicIcfg [2022-04-27 17:43:52,242 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:43:52,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:43:52,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:43:52,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:43:52,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:43:51" (1/4) ... [2022-04-27 17:43:52,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ee398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:43:52, skipping insertion in model container [2022-04-27 17:43:52,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:43:51" (2/4) ... [2022-04-27 17:43:52,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ee398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:43:52, skipping insertion in model container [2022-04-27 17:43:52,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:43:52" (3/4) ... [2022-04-27 17:43:52,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ee398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:43:52, skipping insertion in model container [2022-04-27 17:43:52,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:43:52" (4/4) ... [2022-04-27 17:43:52,246 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.cJordan [2022-04-27 17:43:52,256 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:43:52,256 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:43:52,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:43:52,288 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@60734f2f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b3de63f [2022-04-27 17:43:52,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:43:52,294 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:43:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 17:43:52,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:43:52,303 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:43:52,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:43:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:43:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 890522097, now seen corresponding path program 1 times [2022-04-27 17:43:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:43:52,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070046651] [2022-04-27 17:43:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:43:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:43:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:52,434 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:43:52,435 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:43:52,435 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:43:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:43:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:52,441 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:43:52,442 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:43:52,442 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:43:52,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:43:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:43:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:52,448 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:43:52,449 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:43:52,449 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:43:52,449 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:43:52,450 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:43:52,451 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:43:52,451 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:43:52,451 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:43:52,451 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:43:52,451 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:43:52,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 17:43:52,452 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:43:52,452 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:43:52,452 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:43:52,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:43:52,453 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:43:52,453 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:43:52,453 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:43:52,454 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:43:52,454 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:43:52,454 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:43:52,454 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:43:52,454 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:43:52,455 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:43:52,455 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:43:52,455 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:43:52,455 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:43:52,456 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:43:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:43:52,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070046651] [2022-04-27 17:43:52,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070046651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:43:52,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:43:52,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:43:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111380175] [2022-04-27 17:43:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:43:52,462 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:43:52,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:43:52,465 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:43:52,484 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:43:52,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:43:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:43:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:43:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:43:52,501 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:43:54,759 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:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:54,833 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-27 17:43:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:43:54,833 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:43:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:43:54,834 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:43:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 17:43:54,840 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:43:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 17:43:54,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 17:43:54,928 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:43:54,934 INFO L225 Difference]: With dead ends: 38 [2022-04-27 17:43:54,934 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 17:43:54,935 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:43:54,938 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:43:54,939 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:43:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 17:43:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 17:43:54,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:43:54,959 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:43:54,959 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:43:54,960 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:43:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:54,964 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 17:43:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 17:43:54,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:54,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:54,965 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:43:54,965 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:43:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:43:54,969 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 17:43:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 17:43:54,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:43:54,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:43:54,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:43:54,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:43:54,970 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:43:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 17:43:54,973 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 17:43:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:43:54,973 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 17:43:54,974 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:43:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 17:43:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 17:43:54,974 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:43:54,974 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:43:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:43:54,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:43:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:43:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1386957495, now seen corresponding path program 1 times [2022-04-27 17:43:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:43:54,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369732385] [2022-04-27 17:43:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:43:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:43:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:43:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:55,165 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:43:55,165 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:43:55,165 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:43:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:43:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:55,175 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:43:55,175 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:43:55,175 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:43:55,176 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: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:43:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:43:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:43:55,191 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:43:55,191 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:43:55,191 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:43:55,192 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:43:55,192 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:43:55,192 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:43:55,193 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:43:55,195 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:43:55,196 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:43:55,196 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:43:55,196 INFO L272 TraceCheckUtils]: 6: Hoare triple {194#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:43:55,196 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:43:55,197 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:43:55,197 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:43:55,198 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: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-27 17:43:55,199 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:43:55,199 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:43:55,199 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:43:55,199 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:43:55,199 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:43:55,201 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:43:55,201 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:43:55,202 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:43:55,203 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:43:55,204 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:43:55,204 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:43:55,204 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:43:55,205 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:43:55,206 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:43:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:43:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369732385] [2022-04-27 17:43:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369732385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:43:55,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:43:55,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 17:43:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531181762] [2022-04-27 17:43:55,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:43:55,211 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:55,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:43:55,212 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:43:55,227 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:43:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 17:43:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:43:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 17:43:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 17:43:55,229 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:43:57,660 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:59,663 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:44:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:16,767 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-04-27 17:44:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:44:16,767 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:44:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:44:16,768 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:44:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-04-27 17:44:16,771 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:44:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-04-27 17:44:16,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2022-04-27 17:44:16,918 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:44:16,920 INFO L225 Difference]: With dead ends: 50 [2022-04-27 17:44:16,920 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 17:44:16,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 17:44:16,921 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 48 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-27 17:44:16,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 212 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2022-04-27 17:44:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 17:44:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 17:44:16,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:44:16,938 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:44:16,938 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:44:16,939 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:44:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:16,941 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 17:44:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 17:44:16,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:16,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:16,943 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:44:16,943 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:44:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:16,946 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 17:44:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 17:44:16,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:16,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:16,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:44:16,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:44:16,947 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:44:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 17:44:16,950 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 17:44:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:44:16,950 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 17:44:16,950 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:44:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 17:44:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 17:44:16,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:44:16,951 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:44:16,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:44:16,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:44:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:44:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -472493455, now seen corresponding path program 1 times [2022-04-27 17:44:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:44:16,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807599383] [2022-04-27 17:44:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:44:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:44:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:17,107 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:44:17,107 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:44:17,108 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:44:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:44:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:17,117 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:44:17,117 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:44:17,118 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:44:17,118 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: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:44:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:44:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:17,123 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:44:17,123 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:44:17,123 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:44:17,124 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:44:17,124 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:44:17,124 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:44:17,125 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:44:17,125 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:44:17,125 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:44:17,125 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:44:17,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {418#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:44:17,125 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:44:17,125 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:44:17,125 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:44:17,126 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: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID [2022-04-27 17:44:17,126 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:44:17,126 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:44:17,126 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:44:17,126 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:44:17,126 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:44:17,127 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:44:17,127 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:44:17,127 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:44:17,128 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:44:17,129 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:44:17,129 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:44:17,130 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:44:17,131 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:44:17,131 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:44:17,131 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:44:17,131 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:44:17,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:44:17,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807599383] [2022-04-27 17:44:17,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807599383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:44:17,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:44:17,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 17:44:17,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039483029] [2022-04-27 17:44:17,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:44:17,133 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:44:17,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:44:17,133 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:44:17,147 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:44:17,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 17:44:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:44:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 17:44:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 17:44:17,148 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:44:20,567 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:44:25,497 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:44:27,499 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:44:29,733 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:44:36,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:44:38,963 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:44:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:39,256 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2022-04-27 17:44:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:44:39,257 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:44:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:44:39,257 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:44:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-27 17:44:39,259 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:44:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-27 17:44:39,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-27 17:44:39,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:44:39,559 INFO L225 Difference]: With dead ends: 74 [2022-04-27 17:44:39,559 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 17:44:39,559 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:44:39,560 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 69 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-27 17:44:39,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 14.5s Time] [2022-04-27 17:44:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 17:44:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-27 17:44:39,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:44:39,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 17:44:39,569 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 17:44:39,569 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 17:44:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:39,573 INFO L93 Difference]: Finished difference Result 72 states and 105 transitions. [2022-04-27 17:44:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-04-27 17:44:39,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:39,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:39,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 72 states. [2022-04-27 17:44:39,575 INFO L87 Difference]: Start difference. First operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 72 states. [2022-04-27 17:44:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:39,578 INFO L93 Difference]: Finished difference Result 72 states and 105 transitions. [2022-04-27 17:44:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-04-27 17:44:39,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:39,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:39,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:44:39,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:44:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 17:44:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2022-04-27 17:44:39,583 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 26 [2022-04-27 17:44:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:44:39,583 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2022-04-27 17:44:39,583 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:44:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2022-04-27 17:44:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 17:44:39,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:44:39,584 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:44:39,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 17:44:39,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:44:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:44:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1385093780, now seen corresponding path program 1 times [2022-04-27 17:44:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:44:39,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473542999] [2022-04-27 17:44:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:44:39,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:44:39,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210123781] [2022-04-27 17:44:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:39,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:44:39,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:44:39,608 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:44:39,611 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:44:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:39,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:44:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:39,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:44:39,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {735#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {735#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {735#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {735#true} is VALID [2022-04-27 17:44:39,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#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[] {735#true} is VALID [2022-04-27 17:44:39,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {735#true} {735#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {735#true} is VALID [2022-04-27 17:44:39,927 INFO L272 TraceCheckUtils]: 11: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#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[] {735#true} is VALID [2022-04-27 17:44:39,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {735#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {735#true} {735#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] {735#true} is VALID [2022-04-27 17:44:39,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {735#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] {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:44:39,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:44:39,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(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[] {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:44:39,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:44:39,946 INFO L272 TraceCheckUtils]: 20: Hoare triple {788#(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] {735#true} is VALID [2022-04-27 17:44:39,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {735#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[] {735#true} is VALID [2022-04-27 17:44:39,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {735#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,947 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {735#true} {788#(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] {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:44:39,948 INFO L272 TraceCheckUtils]: 25: Hoare triple {788#(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] {735#true} is VALID [2022-04-27 17:44:39,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {735#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] {735#true} is VALID [2022-04-27 17:44:39,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {735#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[] {735#true} is VALID [2022-04-27 17:44:39,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {735#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-27 17:44:39,948 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {735#true} {788#(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] {788#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 17:44:39,949 INFO L272 TraceCheckUtils]: 30: Hoare triple {788#(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] {831#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:44:39,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {831#(<= 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] {835#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:44:39,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {835#(<= 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[] {736#false} is VALID [2022-04-27 17:44:39,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {736#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {736#false} is VALID [2022-04-27 17:44:39,951 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:44:39,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:44:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:44:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473542999] [2022-04-27 17:44:39,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:44:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210123781] [2022-04-27 17:44:39,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210123781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:44:39,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:44:39,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:44:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054275039] [2022-04-27 17:44:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:44:39,953 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:44:39,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:44:39,953 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:44:39,978 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:44:39,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:44:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:44:39,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:44:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:44:39,979 INFO L87 Difference]: Start difference. First operand 69 states and 100 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:44:42,252 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:44:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:46,093 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-04-27 17:44:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:44:46,093 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:44:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:44:46,093 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:44:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:44:46,095 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:44:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:44:46,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 17:44:46,155 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:44:46,158 INFO L225 Difference]: With dead ends: 78 [2022-04-27 17:44:46,158 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 17:44:46,158 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:44:46,159 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 17:44:46,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 17:44:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 17:44:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 17:44:46,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:44:46,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:44:46,163 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:44:46,164 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:44:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:46,166 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-04-27 17:44:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-27 17:44:46,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:46,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:46,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 57 states. [2022-04-27 17:44:46,167 INFO L87 Difference]: Start difference. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 57 states. [2022-04-27 17:44:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:46,169 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-04-27 17:44:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-27 17:44:46,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:46,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:46,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:44:46,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:44:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 17:44:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2022-04-27 17:44:46,196 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 34 [2022-04-27 17:44:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:44:46,196 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-04-27 17:44:46,197 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:44:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-27 17:44:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 17:44:46,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:44:46,197 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:44:46,211 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:44:46,400 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:44:46,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:44:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:44:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash 419889614, now seen corresponding path program 1 times [2022-04-27 17:44:46,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:44:46,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981915078] [2022-04-27 17:44:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:44:46,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:44:46,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778522995] [2022-04-27 17:44:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:44:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:44:46,412 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:44:46,413 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:44:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:46,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:44:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:44:46,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:44:46,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {1092#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1092#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1092#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {1092#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#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[] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1092#true} {1092#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~n~0_17 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1092#true} is VALID [2022-04-27 17:44:46,633 INFO L272 TraceCheckUtils]: 11: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#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[] {1092#true} is VALID [2022-04-27 17:44:46,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,634 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1092#true} {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#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] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {1145#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {1145#(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] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {1145#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {1145#(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[] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {1145#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,636 INFO L272 TraceCheckUtils]: 22: Hoare triple {1145#(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] {1092#true} is VALID [2022-04-27 17:44:46,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {1092#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[] {1092#true} is VALID [2022-04-27 17:44:46,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {1092#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,637 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1092#true} {1145#(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] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,637 INFO L272 TraceCheckUtils]: 27: Hoare triple {1145#(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] {1092#true} is VALID [2022-04-27 17:44:46,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {1092#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] {1092#true} is VALID [2022-04-27 17:44:46,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#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[] {1092#true} is VALID [2022-04-27 17:44:46,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1092#true} is VALID [2022-04-27 17:44:46,638 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1092#true} {1145#(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] {1145#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 17:44:46,639 INFO L272 TraceCheckUtils]: 32: Hoare triple {1145#(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] {1194#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:44:46,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {1194#(<= 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] {1198#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:44:46,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {1198#(<= 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[] {1093#false} is VALID [2022-04-27 17:44:46,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {1093#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#false} is VALID [2022-04-27 17:44:46,640 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:44:46,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:44:46,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:44:46,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981915078] [2022-04-27 17:44:46,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:44:46,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778522995] [2022-04-27 17:44:46,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778522995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:44:46,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:44:46,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:44:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79315003] [2022-04-27 17:44:46,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:44:46,641 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:44:46,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:44:46,641 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:44:46,675 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:44:46,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:44:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:44:46,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:44:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:44:46,676 INFO L87 Difference]: Start difference. First operand 57 states and 82 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:44:49,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:44:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:52,866 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2022-04-27 17:44:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:44:52,866 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:44:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:44:52,866 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:44:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 17:44:52,868 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:44:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 17:44:52,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 17:44:52,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:44:52,932 INFO L225 Difference]: With dead ends: 68 [2022-04-27 17:44:52,932 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 17:44:52,932 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:44:52,932 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 17:44:52,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 17:44:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 17:44:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 17:44:52,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:44:52,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:44:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:44:52,937 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:44:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:52,940 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2022-04-27 17:44:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-04-27 17:44:52,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:52,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:52,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-27 17:44:52,941 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-27 17:44:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:44:52,943 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2022-04-27 17:44:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-04-27 17:44:52,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:44:52,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:44:52,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:44:52,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:44:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 17:44:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2022-04-27 17:44:52,950 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 36 [2022-04-27 17:44:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:44:52,950 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2022-04-27 17:44:52,950 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:44:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-04-27 17:44:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 17:44:52,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:44:52,951 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:44:52,960 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:44:53,157 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:44:53,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:44:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:44:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1513839050, now seen corresponding path program 1 times [2022-04-27 17:44:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:44:53,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047573042] [2022-04-27 17:44:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:44:53,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:44:53,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317881915] [2022-04-27 17:44:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:44:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:44:53,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:44:53,181 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:44:53,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process