/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/hard2_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:59:45,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:59:45,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:59:45,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:59:45,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:59:45,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:59:45,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:59:45,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:59:45,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:59:45,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:59:45,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:59:45,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:59:45,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:59:45,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:59:45,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:59:45,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:59:45,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:59:45,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:59:45,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:59:45,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:59:45,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:59:45,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:59:45,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:59:45,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:59:45,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:59:45,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:59:45,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:59:45,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:59:45,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:59:45,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:59:45,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:59:45,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:59:45,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:59:45,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:59:45,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:59:45,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:59:45,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:59:45,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:59:45,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:59:45,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:59:45,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:59:45,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:59:45,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:59:45,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:59:45,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:59:45,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:59:45,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:59:45,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:59:45,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:59:45,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:59:45,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:59:45,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:59:45,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:59:45,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:59:45,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:59:45,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:59:45,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:59:45,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:59:45,883 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:59:45,883 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 19:59:46,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:59:46,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:59:46,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:59:46,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:59:46,082 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:59:46,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c [2022-04-07 19:59:46,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f006415/67353013f88244e3a6e3373a840927dc/FLAG1f9db6f5d [2022-04-07 19:59:46,496 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:59:46,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c [2022-04-07 19:59:46,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f006415/67353013f88244e3a6e3373a840927dc/FLAG1f9db6f5d [2022-04-07 19:59:46,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f006415/67353013f88244e3a6e3373a840927dc [2022-04-07 19:59:46,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:59:46,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:59:46,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:59:46,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:59:46,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:59:46,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:59:46" (1/1) ... [2022-04-07 19:59:46,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422db9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:46, skipping insertion in model container [2022-04-07 19:59:46,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:59:46" (1/1) ... [2022-04-07 19:59:46,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:59:46,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:59:47,095 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/hard2_unwindbound2.c[526,539] [2022-04-07 19:59:47,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:59:47,143 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:59:47,159 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/hard2_unwindbound2.c[526,539] [2022-04-07 19:59:47,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:59:47,188 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:59:47,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47 WrapperNode [2022-04-07 19:59:47,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:59:47,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:59:47,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:59:47,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:59:47,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:59:47,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:59:47,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:59:47,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:59:47,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:59:47,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:47,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 19:59:47,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 19:59:47,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:59:47,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:59:47,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:59:47,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:59:47,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:59:47,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:59:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:59:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:59:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:59:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:59:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 19:59:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:59:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:59:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:59:47,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:59:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:59:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:59:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:59:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:59:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:59:47,377 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:59:47,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:59:47,497 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:59:47,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:59:47,503 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 19:59:47,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:59:47 BoogieIcfgContainer [2022-04-07 19:59:47,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:59:47,505 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:59:47,505 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:59:47,506 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:59:47,509 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:59:47" (1/1) ... [2022-04-07 19:59:47,510 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:59:47,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:59:47 BasicIcfg [2022-04-07 19:59:47,535 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:59:47,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:59:47,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:59:47,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:59:47,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:59:46" (1/4) ... [2022-04-07 19:59:47,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942b5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:59:47, skipping insertion in model container [2022-04-07 19:59:47,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:59:47" (2/4) ... [2022-04-07 19:59:47,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942b5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:59:47, skipping insertion in model container [2022-04-07 19:59:47,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:59:47" (3/4) ... [2022-04-07 19:59:47,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942b5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:59:47, skipping insertion in model container [2022-04-07 19:59:47,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:59:47" (4/4) ... [2022-04-07 19:59:47,541 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound2.cJordan [2022-04-07 19:59:47,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:59:47,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:59:47,577 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:59:47,583 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 19:59:47,583 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:59:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:59:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 19:59:47,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:47,605 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:47,605 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash 121155216, now seen corresponding path program 1 times [2022-04-07 19:59:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509679825] [2022-04-07 19:59:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:59:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:47,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 19:59:47,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:59:47,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:59:47,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:59:47,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 19:59:47,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:59:47,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:59:47,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:59:47,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {34#true} is VALID [2022-04-07 19:59:47,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [101] L34-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:59:47,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} [103] L52-2-->L44-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:59:47,795 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {35#false} is VALID [2022-04-07 19:59:47,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [112] __VERIFIER_assertENTRY-->L15: 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] {35#false} is VALID [2022-04-07 19:59:47,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [116] L15-->L16: 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[] {35#false} is VALID [2022-04-07 19:59:47,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:59:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:59:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:47,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509679825] [2022-04-07 19:59:47,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509679825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:47,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:47,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:59:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459852323] [2022-04-07 19:59:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:59:47,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:47,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:47,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:47,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:59:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:59:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:59:47,844 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:48,020 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 19:59:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:59:48,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:59:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-07 19:59:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-07 19:59:48,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-07 19:59:48,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:48,122 INFO L225 Difference]: With dead ends: 32 [2022-04-07 19:59:48,123 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 19:59:48,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:59:48,127 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:48,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:59:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 19:59:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 19:59:48,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:48,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,153 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,154 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:48,158 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-07 19:59:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-07 19:59:48,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:48,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:48,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-07 19:59:48,160 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-07 19:59:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:48,163 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-07 19:59:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-07 19:59:48,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:48,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:48,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:48,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-07 19:59:48,168 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-07 19:59:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:48,168 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-07 19:59:48,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-07 19:59:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 19:59:48,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:48,169 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:48,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:59:48,170 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 152644303, now seen corresponding path program 1 times [2022-04-07 19:59:48,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:48,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669485492] [2022-04-07 19:59:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:59:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:48,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {154#true} is VALID [2022-04-07 19:59:48,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-07 19:59:48,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-07 19:59:48,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:59:48,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {154#true} is VALID [2022-04-07 19:59:48,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-07 19:59:48,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-07 19:59:48,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-07 19:59:48,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {159#(= main_~q~0 0)} is VALID [2022-04-07 19:59:48,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= main_~q~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {159#(= main_~q~0 0)} is VALID [2022-04-07 19:59:48,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(= main_~q~0 0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {159#(= main_~q~0 0)} is VALID [2022-04-07 19:59:48,308 INFO L272 TraceCheckUtils]: 8: Hoare triple {159#(= main_~q~0 0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:59:48,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {160#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L15: 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] {161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:59:48,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(not (= __VERIFIER_assert_~cond 0))} [116] L15-->L16: 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[] {155#false} is VALID [2022-04-07 19:59:48,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-07 19:59:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:59:48,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:48,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669485492] [2022-04-07 19:59:48,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669485492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:48,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:48,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:59:48,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540224678] [2022-04-07 19:59:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:59:48,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:48,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:48,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:59:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:59:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:59:48,328 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:48,647 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-07 19:59:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 19:59:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:59:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-07 19:59:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-07 19:59:48,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-07 19:59:48,720 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-07 19:59:48,724 INFO L225 Difference]: With dead ends: 39 [2022-04-07 19:59:48,724 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 19:59:48,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:59:48,729 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:48,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:59:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 19:59:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-07 19:59:48,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:48,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,734 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,734 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:48,738 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-07 19:59:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-07 19:59:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:48,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:48,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-07 19:59:48,740 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-07 19:59:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:48,742 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-07 19:59:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-07 19:59:48,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:48,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:48,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:48,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-07 19:59:48,745 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-07 19:59:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:48,746 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-07 19:59:48,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-07 19:59:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 19:59:48,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:48,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:48,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 19:59:48,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -400958603, now seen corresponding path program 1 times [2022-04-07 19:59:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:48,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052244742] [2022-04-07 19:59:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:59:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:48,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#(<= ~counter~0 0)} {320#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:59:48,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#(<= ~counter~0 0)} {320#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {325#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:48,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {326#(<= |main_#t~post5| 0)} is VALID [2022-04-07 19:59:48,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(<= |main_#t~post5| 0)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {321#false} is VALID [2022-04-07 19:59:48,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {321#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {321#false} is VALID [2022-04-07 19:59:48,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {321#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {321#false} is VALID [2022-04-07 19:59:48,884 INFO L272 TraceCheckUtils]: 10: Hoare triple {321#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {321#false} is VALID [2022-04-07 19:59:48,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#false} [112] __VERIFIER_assertENTRY-->L15: 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] {321#false} is VALID [2022-04-07 19:59:48,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {321#false} [116] L15-->L16: 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[] {321#false} is VALID [2022-04-07 19:59:48,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {321#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#false} is VALID [2022-04-07 19:59:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:59:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:48,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052244742] [2022-04-07 19:59:48,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052244742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:48,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:48,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:59:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340020935] [2022-04-07 19:59:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 19:59:48,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:48,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:48,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:48,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:59:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:59:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:59:48,918 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:49,080 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 19:59:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:59:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 19:59:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 19:59:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 19:59:49,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 19:59:49,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:49,120 INFO L225 Difference]: With dead ends: 32 [2022-04-07 19:59:49,120 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 19:59:49,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:59:49,127 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:49,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:59:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 19:59:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 19:59:49,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:49,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,148 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,149 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:49,154 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 19:59:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 19:59:49,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:49,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:49,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-07 19:59:49,155 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-07 19:59:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:49,157 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 19:59:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 19:59:49,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:49,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:49,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:49,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-07 19:59:49,160 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-07 19:59:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:49,160 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-07 19:59:49,160 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:59:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 19:59:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 19:59:49,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:49,161 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:49,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 19:59:49,161 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 185978583, now seen corresponding path program 1 times [2022-04-07 19:59:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:49,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286710898] [2022-04-07 19:59:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:49,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:59:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:49,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {472#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {460#true} is VALID [2022-04-07 19:59:49,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-07 19:59:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:49,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} [112] __VERIFIER_assertENTRY-->L15: 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] {460#true} is VALID [2022-04-07 19:59:49,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [117] L15-->L15-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[] {460#true} is VALID [2022-04-07 19:59:49,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {465#(= main_~A~0 main_~r~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {465#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:59:49,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:59:49,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {472#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {460#true} is VALID [2022-04-07 19:59:49,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {465#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:59:49,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#(= main_~A~0 main_~r~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {465#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:59:49,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(= main_~A~0 main_~r~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {465#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:59:49,270 INFO L272 TraceCheckUtils]: 8: Hoare triple {465#(= main_~A~0 main_~r~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {460#true} is VALID [2022-04-07 19:59:49,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} [112] __VERIFIER_assertENTRY-->L15: 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] {460#true} is VALID [2022-04-07 19:59:49,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#true} [117] L15-->L15-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[] {460#true} is VALID [2022-04-07 19:59:49,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 19:59:49,272 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {460#true} {465#(= main_~A~0 main_~r~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {465#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:59:49,272 INFO L272 TraceCheckUtils]: 13: Hoare triple {465#(= main_~A~0 main_~r~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {470#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:59:49,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L15: 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] {471#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:59:49,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {471#(not (= __VERIFIER_assert_~cond 0))} [116] L15-->L16: 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[] {461#false} is VALID [2022-04-07 19:59:49,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 19:59:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:59:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:49,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286710898] [2022-04-07 19:59:49,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286710898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:49,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:49,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:59:49,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269643160] [2022-04-07 19:59:49,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 19:59:49,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:49,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:59:49,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:49,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:59:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:49,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:59:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:59:49,290 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:59:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:49,565 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 19:59:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 19:59:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 19:59:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:59:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-07 19:59:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:59:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-07 19:59:49,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-07 19:59:49,615 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-07 19:59:49,616 INFO L225 Difference]: With dead ends: 44 [2022-04-07 19:59:49,616 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 19:59:49,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:59:49,618 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:49,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:59:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 19:59:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-07 19:59:49,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:49,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,622 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,622 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:49,625 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 19:59:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-07 19:59:49,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:49,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:49,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-07 19:59:49,626 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-07 19:59:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:49,629 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 19:59:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-07 19:59:49,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:49,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:49,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:49,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:59:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-07 19:59:49,632 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-07 19:59:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:49,633 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-07 19:59:49,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:59:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-07 19:59:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 19:59:49,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:49,633 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:49,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 19:59:49,634 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -820589269, now seen corresponding path program 1 times [2022-04-07 19:59:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:49,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442180193] [2022-04-07 19:59:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:49,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:59:49,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663863022] [2022-04-07 19:59:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:49,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:49,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:59:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 19:59:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:49,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:59:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:49,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:59:49,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#true} is VALID [2022-04-07 19:59:49,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {651#true} is VALID [2022-04-07 19:59:49,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#true} is VALID [2022-04-07 19:59:49,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#true} is VALID [2022-04-07 19:59:49,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#true} is VALID [2022-04-07 19:59:49,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:49,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:49,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:49,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {651#true} is VALID [2022-04-07 19:59:49,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#true} [112] __VERIFIER_assertENTRY-->L15: 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] {651#true} is VALID [2022-04-07 19:59:49,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {651#true} [117] L15-->L15-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[] {651#true} is VALID [2022-04-07 19:59:49,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {651#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#true} is VALID [2022-04-07 19:59:49,993 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {651#true} {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:49,993 INFO L272 TraceCheckUtils]: 13: Hoare triple {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {651#true} is VALID [2022-04-07 19:59:49,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {651#true} [112] __VERIFIER_assertENTRY-->L15: 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] {651#true} is VALID [2022-04-07 19:59:49,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {651#true} [117] L15-->L15-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[] {651#true} is VALID [2022-04-07 19:59:49,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {651#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#true} is VALID [2022-04-07 19:59:49,994 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {651#true} {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:49,996 INFO L272 TraceCheckUtils]: 18: Hoare triple {671#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {711#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:59:49,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {711#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: 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] {715#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:59:49,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {715#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: 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[] {652#false} is VALID [2022-04-07 19:59:49,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {652#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#false} is VALID [2022-04-07 19:59:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:59:50,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:59:50,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:50,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442180193] [2022-04-07 19:59:50,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:59:50,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663863022] [2022-04-07 19:59:50,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663863022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:50,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:50,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:59:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864719627] [2022-04-07 19:59:50,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 19:59:50,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:50,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:59:50,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:50,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:59:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:59:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:59:50,021 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:59:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:50,185 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-07 19:59:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:59:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 19:59:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:59:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-07 19:59:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:59:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-07 19:59:50,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-07 19:59:50,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:50,247 INFO L225 Difference]: With dead ends: 51 [2022-04-07 19:59:50,247 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 19:59:50,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:59:50,250 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:50,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:59:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 19:59:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 19:59:50,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:50,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,255 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,255 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:50,258 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 19:59:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 19:59:50,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:50,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:50,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-07 19:59:50,259 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-07 19:59:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:50,262 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 19:59:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 19:59:50,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:50,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:50,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:50,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-07 19:59:50,265 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-07 19:59:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:50,265 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-07 19:59:50,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:59:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 19:59:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 19:59:50,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:50,266 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:50,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 19:59:50,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:50,490 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1259710898, now seen corresponding path program 1 times [2022-04-07 19:59:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996704308] [2022-04-07 19:59:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:50,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:59:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062737354] [2022-04-07 19:59:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:50,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:59:50,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 19:59:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:50,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:59:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:50,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:59:50,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {924#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 19:59:50,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {924#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {932#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:50,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {932#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {932#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:50,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {932#(<= ~counter~0 0)} {924#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {932#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:50,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {932#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {932#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:50,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {932#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:50,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {932#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#(<= ~counter~0 1)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,787 INFO L272 TraceCheckUtils]: 8: Hoare triple {948#(<= ~counter~0 1)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {948#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: 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] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#(<= ~counter~0 1)} [117] L15-->L15-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[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {948#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,790 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {948#(<= ~counter~0 1)} {948#(<= ~counter~0 1)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,791 INFO L272 TraceCheckUtils]: 13: Hoare triple {948#(<= ~counter~0 1)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: 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] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#(<= ~counter~0 1)} [117] L15-->L15-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[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {948#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,793 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {948#(<= ~counter~0 1)} {948#(<= ~counter~0 1)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,794 INFO L272 TraceCheckUtils]: 18: Hoare triple {948#(<= ~counter~0 1)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: 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] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {948#(<= ~counter~0 1)} [117] L15-->L15-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[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {948#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,797 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {948#(<= ~counter~0 1)} {948#(<= ~counter~0 1)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {948#(<= ~counter~0 1)} [126] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[] {948#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:50,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {948#(<= ~counter~0 1)} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1003#(<= |main_#t~post6| 1)} is VALID [2022-04-07 19:59:50,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#(<= |main_#t~post6| 1)} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {925#false} is VALID [2022-04-07 19:59:50,806 INFO L272 TraceCheckUtils]: 26: Hoare triple {925#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {925#false} is VALID [2022-04-07 19:59:50,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {925#false} [112] __VERIFIER_assertENTRY-->L15: 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] {925#false} is VALID [2022-04-07 19:59:50,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {925#false} [116] L15-->L16: 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[] {925#false} is VALID [2022-04-07 19:59:50,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {925#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-07 19:59:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:59:50,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:59:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:50,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996704308] [2022-04-07 19:59:50,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:59:50,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062737354] [2022-04-07 19:59:50,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062737354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:50,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:50,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:59:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694337903] [2022-04-07 19:59:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-07 19:59:50,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:50,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:50,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:50,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:59:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:59:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:59:50,827 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:50,922 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-07 19:59:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:59:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-07 19:59:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-07 19:59:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-07 19:59:50,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-07 19:59:50,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:50,965 INFO L225 Difference]: With dead ends: 63 [2022-04-07 19:59:50,965 INFO L226 Difference]: Without dead ends: 63 [2022-04-07 19:59:50,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:59:50,966 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:50,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 124 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:59:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-07 19:59:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-07 19:59:50,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:50,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,971 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,971 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:50,977 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-07 19:59:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-07 19:59:50,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:50,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:50,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-07 19:59:50,980 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-07 19:59:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:50,982 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-07 19:59:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-07 19:59:50,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:50,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:50,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:50,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:59:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-07 19:59:50,985 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-07 19:59:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:50,985 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-07 19:59:50,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-07 19:59:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 19:59:50,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:50,986 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:51,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 19:59:51,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-07 19:59:51,204 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1260813165, now seen corresponding path program 1 times [2022-04-07 19:59:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206618844] [2022-04-07 19:59:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:51,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:59:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563925621] [2022-04-07 19:59:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:51,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:51,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:59:51,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 19:59:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:51,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:59:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:51,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:59:51,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1269#true} is VALID [2022-04-07 19:59:51,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1269#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1269#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {1269#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1269#true} is VALID [2022-04-07 19:59:51,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1269#true} is VALID [2022-04-07 19:59:51,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1269#true} [117] L15-->L15-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[] {1269#true} is VALID [2022-04-07 19:59:51,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,434 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1269#true} {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,434 INFO L272 TraceCheckUtils]: 13: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1269#true} is VALID [2022-04-07 19:59:51,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1269#true} is VALID [2022-04-07 19:59:51,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1269#true} [117] L15-->L15-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[] {1269#true} is VALID [2022-04-07 19:59:51,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1269#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1269#true} {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1269#true} is VALID [2022-04-07 19:59:51,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1269#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1269#true} is VALID [2022-04-07 19:59:51,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1269#true} [117] L15-->L15-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[] {1269#true} is VALID [2022-04-07 19:59:51,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1269#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-07 19:59:51,436 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1269#true} {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [126] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [109] L44-->L45: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:59:51,438 INFO L272 TraceCheckUtils]: 26: Hoare triple {1289#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [113] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_8 (+ (* v_main_~q~0_10 v_main_~B~0_9) v_main_~r~0_13)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_10, main_~B~0=v_main_~B~0_9, main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:59:51,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: 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] {1357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:59:51,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {1357#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: 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[] {1270#false} is VALID [2022-04-07 19:59:51,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {1270#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-07 19:59:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:59:51,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:59:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206618844] [2022-04-07 19:59:51,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:59:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563925621] [2022-04-07 19:59:51,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563925621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:59:51,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:59:51,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:59:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465900573] [2022-04-07 19:59:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-07 19:59:51,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:51,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:51,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:51,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:59:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:59:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:59:51,459 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:51,605 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-07 19:59:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:59:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-07 19:59:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-07 19:59:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-07 19:59:51,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-07 19:59:51,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:51,657 INFO L225 Difference]: With dead ends: 74 [2022-04-07 19:59:51,657 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 19:59:51,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:59:51,659 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:51,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:59:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 19:59:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-07 19:59:51,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:51,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:51,668 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:51,668 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:51,670 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-07 19:59:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-07 19:59:51,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:51,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:51,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-07 19:59:51,671 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-07 19:59:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:51,674 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-07 19:59:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-07 19:59:51,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:51,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:51,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:51,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-07 19:59:51,677 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-07 19:59:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:51,677 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-07 19:59:51,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-07 19:59:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 19:59:51,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:51,678 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:51,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 19:59:51,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:51,892 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1811137592, now seen corresponding path program 1 times [2022-04-07 19:59:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:51,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723145608] [2022-04-07 19:59:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:51,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:59:51,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555259585] [2022-04-07 19:59:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:51,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:51,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:59:51,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 19:59:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:51,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:59:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:51,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:59:52,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1630#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#true} is VALID [2022-04-07 19:59:52,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#(<= ~counter~0 0)} {1630#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {1638#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#(<= ~counter~0 1)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,120 INFO L272 TraceCheckUtils]: 8: Hoare triple {1654#(<= ~counter~0 1)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: 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] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {1654#(<= ~counter~0 1)} [117] L15-->L15-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[] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,127 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1654#(<= ~counter~0 1)} {1654#(<= ~counter~0 1)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,132 INFO L272 TraceCheckUtils]: 13: Hoare triple {1654#(<= ~counter~0 1)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: 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] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1654#(<= ~counter~0 1)} [117] L15-->L15-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[] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,133 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1654#(<= ~counter~0 1)} {1654#(<= ~counter~0 1)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,134 INFO L272 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(<= ~counter~0 1)} [112] __VERIFIER_assertENTRY-->L15: 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] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(<= ~counter~0 1)} [117] L15-->L15-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[] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#(<= ~counter~0 1)} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,136 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1654#(<= ~counter~0 1)} {1654#(<= ~counter~0 1)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#(<= ~counter~0 1)} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#(<= ~counter~0 1)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1709#(<= |main_#t~post5| 1)} is VALID [2022-04-07 19:59:52,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {1709#(<= |main_#t~post5| 1)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1631#false} is VALID [2022-04-07 19:59:52,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {1631#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1631#false} is VALID [2022-04-07 19:59:52,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1631#false} is VALID [2022-04-07 19:59:52,137 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#false} [112] __VERIFIER_assertENTRY-->L15: 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] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#false} [117] L15-->L15-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[] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#false} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1631#false} {1631#false} [137] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L272 TraceCheckUtils]: 33: Hoare triple {1631#false} [111] L58-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~B~0_11 v_main_~d~0_18) 1 0)) InVars {main_~d~0=v_main_~d~0_18, main_~B~0=v_main_~B~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#false} [112] __VERIFIER_assertENTRY-->L15: 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] {1631#false} is VALID [2022-04-07 19:59:52,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#false} [116] L15-->L16: 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[] {1631#false} is VALID [2022-04-07 19:59:52,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {1631#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#false} is VALID [2022-04-07 19:59:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-07 19:59:52,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:59:52,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {1631#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#false} is VALID [2022-04-07 19:59:52,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#false} [116] L15-->L16: 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[] {1631#false} is VALID [2022-04-07 19:59:52,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#false} [112] __VERIFIER_assertENTRY-->L15: 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] {1631#false} is VALID [2022-04-07 19:59:52,312 INFO L272 TraceCheckUtils]: 33: Hoare triple {1631#false} [111] L58-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (= v_main_~B~0_11 v_main_~d~0_18) 1 0)) InVars {main_~d~0=v_main_~d~0_18, main_~B~0=v_main_~B~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0] {1631#false} is VALID [2022-04-07 19:59:52,312 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1630#true} {1631#false} [137] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1631#false} is VALID [2022-04-07 19:59:52,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {1630#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#true} is VALID [2022-04-07 19:59:52,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {1630#true} [117] L15-->L15-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[] {1630#true} is VALID [2022-04-07 19:59:52,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {1630#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1630#true} is VALID [2022-04-07 19:59:52,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1630#true} is VALID [2022-04-07 19:59:52,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1631#false} is VALID [2022-04-07 19:59:52,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {1631#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1631#false} is VALID [2022-04-07 19:59:52,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {1709#(<= |main_#t~post5| 1)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1631#false} is VALID [2022-04-07 19:59:52,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#(<= ~counter~0 1)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1709#(<= |main_#t~post5| 1)} is VALID [2022-04-07 19:59:52,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#(<= ~counter~0 1)} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,318 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1630#true} {1654#(<= ~counter~0 1)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#true} is VALID [2022-04-07 19:59:52,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#true} [117] L15-->L15-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[] {1630#true} is VALID [2022-04-07 19:59:52,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {1630#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1630#true} is VALID [2022-04-07 19:59:52,319 INFO L272 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1630#true} is VALID [2022-04-07 19:59:52,319 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1630#true} {1654#(<= ~counter~0 1)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#true} is VALID [2022-04-07 19:59:52,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {1630#true} [117] L15-->L15-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[] {1630#true} is VALID [2022-04-07 19:59:52,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1630#true} is VALID [2022-04-07 19:59:52,320 INFO L272 TraceCheckUtils]: 13: Hoare triple {1654#(<= ~counter~0 1)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1630#true} is VALID [2022-04-07 19:59:52,320 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1630#true} {1654#(<= ~counter~0 1)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1630#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#true} is VALID [2022-04-07 19:59:52,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {1630#true} [117] L15-->L15-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[] {1630#true} is VALID [2022-04-07 19:59:52,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#true} [112] __VERIFIER_assertENTRY-->L15: 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] {1630#true} is VALID [2022-04-07 19:59:52,321 INFO L272 TraceCheckUtils]: 8: Hoare triple {1654#(<= ~counter~0 1)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1630#true} is VALID [2022-04-07 19:59:52,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#(<= ~counter~0 1)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {1638#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1654#(<= ~counter~0 1)} is VALID [2022-04-07 19:59:52,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#(<= ~counter~0 0)} {1630#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1638#(<= ~counter~0 0)} is VALID [2022-04-07 19:59:52,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1630#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#true} is VALID [2022-04-07 19:59:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:59:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723145608] [2022-04-07 19:59:52,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:59:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555259585] [2022-04-07 19:59:52,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555259585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:59:52,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:59:52,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-07 19:59:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277345107] [2022-04-07 19:59:52,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:59:52,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2022-04-07 19:59:52,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:52,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:59:52,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:52,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:59:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:52,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:59:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:59:52,359 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:59:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:52,475 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-07 19:59:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:59:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2022-04-07 19:59:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:59:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 19:59:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:59:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 19:59:52,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 19:59:52,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:52,529 INFO L225 Difference]: With dead ends: 65 [2022-04-07 19:59:52,529 INFO L226 Difference]: Without dead ends: 65 [2022-04-07 19:59:52,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:59:52,530 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:52,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:59:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-07 19:59:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-07 19:59:52,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:52,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:52,539 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:52,544 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:52,546 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-07 19:59:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-07 19:59:52,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:52,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:52,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-07 19:59:52,548 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-07 19:59:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:52,551 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-07 19:59:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-07 19:59:52,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:52,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:52,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:52,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:59:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-07 19:59:52,554 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-07 19:59:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:52,555 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-07 19:59:52,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:59:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-07 19:59:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 19:59:52,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:52,555 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:52,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 19:59:52,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:52,771 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -599722260, now seen corresponding path program 1 times [2022-04-07 19:59:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:52,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360977804] [2022-04-07 19:59:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:52,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:59:52,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049812502] [2022-04-07 19:59:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:52,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:52,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:59:52,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 19:59:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:52,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 19:59:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:59:52,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:59:53,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {2118#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2118#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2118#true} is VALID [2022-04-07 19:59:53,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {2118#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2118#true} {2118#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {2118#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {2118#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:53,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:53,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:53,076 INFO L272 TraceCheckUtils]: 8: Hoare triple {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2118#true} is VALID [2022-04-07 19:59:53,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,077 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2118#true} {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:53,077 INFO L272 TraceCheckUtils]: 13: Hoare triple {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2118#true} is VALID [2022-04-07 19:59:53,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,083 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2118#true} {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:53,083 INFO L272 TraceCheckUtils]: 18: Hoare triple {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2118#true} is VALID [2022-04-07 19:59:53,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,084 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2118#true} {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:59:53,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-07 19:59:53,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-07 19:59:53,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-07 19:59:53,086 INFO L272 TraceCheckUtils]: 26: Hoare triple {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2118#true} is VALID [2022-04-07 19:59:53,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,087 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2118#true} {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-07 19:59:53,087 INFO L272 TraceCheckUtils]: 31: Hoare triple {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2118#true} is VALID [2022-04-07 19:59:53,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,088 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2118#true} {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-07 19:59:53,089 INFO L272 TraceCheckUtils]: 36: Hoare triple {2193#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:59:53,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {2233#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: 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] {2237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:59:53,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {2237#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: 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[] {2119#false} is VALID [2022-04-07 19:59:53,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {2119#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#false} is VALID [2022-04-07 19:59:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 19:59:53,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:59:53,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {2119#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#false} is VALID [2022-04-07 19:59:53,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {2237#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: 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[] {2119#false} is VALID [2022-04-07 19:59:53,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {2233#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: 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] {2237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:59:53,266 INFO L272 TraceCheckUtils]: 36: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:59:53,267 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2118#true} {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,267 INFO L272 TraceCheckUtils]: 31: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2118#true} is VALID [2022-04-07 19:59:53,268 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2118#true} {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,269 INFO L272 TraceCheckUtils]: 26: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2118#true} is VALID [2022-04-07 19:59:53,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [127] L37-->L34-3: Formula: (and (<= v_main_~d~0_14 v_main_~r~0_11) (= (* 2 v_main_~d~0_14) v_main_~d~0_13) (= v_main_~p~0_10 (* v_main_~p~0_11 2))) InVars {main_~d~0=v_main_~d~0_14, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11} OutVars{main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,271 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2118#true} {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,272 INFO L272 TraceCheckUtils]: 18: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2118#true} is VALID [2022-04-07 19:59:53,272 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2118#true} {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,273 INFO L272 TraceCheckUtils]: 13: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2118#true} is VALID [2022-04-07 19:59:53,273 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2118#true} {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {2118#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {2118#true} [117] L15-->L15-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[] {2118#true} is VALID [2022-04-07 19:59:53,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {2118#true} [112] __VERIFIER_assertENTRY-->L15: 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] {2118#true} is VALID [2022-04-07 19:59:53,274 INFO L272 TraceCheckUtils]: 8: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2118#true} is VALID [2022-04-07 19:59:53,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {2118#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2253#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-07 19:59:53,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {2118#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2118#true} {2118#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {2118#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {2118#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2118#true} is VALID [2022-04-07 19:59:53,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {2118#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#true} is VALID [2022-04-07 19:59:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-07 19:59:53,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:59:53,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360977804] [2022-04-07 19:59:53,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:59:53,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049812502] [2022-04-07 19:59:53,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049812502] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:59:53,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:59:53,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 19:59:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558022028] [2022-04-07 19:59:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:59:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-07 19:59:53,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:59:53,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:53,296 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-07 19:59:53,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:59:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:59:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:59:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 19:59:53,297 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:54,934 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-07 19:59:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:59:54,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-07 19:59:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:59:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-07 19:59:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-07 19:59:54,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2022-04-07 19:59:54,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:59:54,990 INFO L225 Difference]: With dead ends: 76 [2022-04-07 19:59:54,990 INFO L226 Difference]: Without dead ends: 76 [2022-04-07 19:59:54,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 19:59:54,991 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:59:54,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:59:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-07 19:59:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-07 19:59:54,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:59:54,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:59:54,998 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:59:54,998 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:59:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:55,005 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-07 19:59:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-07 19:59:55,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:55,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:55,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-07 19:59:55,008 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-07 19:59:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:59:55,011 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-07 19:59:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-07 19:59:55,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:59:55,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:59:55,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:59:55,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:59:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:59:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-07 19:59:55,015 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-07 19:59:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:59:55,015 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-07 19:59:55,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:59:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-07 19:59:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-07 19:59:55,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:59:55,017 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:55,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 19:59:55,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:55,240 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:59:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:59:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash 560903707, now seen corresponding path program 1 times [2022-04-07 19:59:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:59:55,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148113831] [2022-04-07 19:59:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:59:55,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:59:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73784727] [2022-04-07 19:59:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:59:55,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:55,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:59:55,252 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:59:55,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 19:59:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:59:55,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:59:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:59:55,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:59:55,371 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:59:55,372 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:59:55,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 19:59:55,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:59:55,606 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:59:55,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:59:55,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:59:55 BasicIcfg [2022-04-07 19:59:55,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:59:55,658 INFO L158 Benchmark]: Toolchain (without parser) took 8732.93ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 131.9MB in the beginning and 104.8MB in the end (delta: 27.1MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-04-07 19:59:55,658 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 148.3MB in the beginning and 148.3MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:59:55,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.75ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 131.7MB in the beginning and 195.4MB in the end (delta: -63.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 19:59:55,659 INFO L158 Benchmark]: Boogie Preprocessor took 44.97ms. Allocated memory is still 219.2MB. Free memory was 195.4MB in the beginning and 193.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 19:59:55,662 INFO L158 Benchmark]: RCFGBuilder took 268.63ms. Allocated memory is still 219.2MB. Free memory was 193.8MB in the beginning and 182.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 19:59:55,665 INFO L158 Benchmark]: IcfgTransformer took 30.05ms. Allocated memory is still 219.2MB. Free memory was 181.8MB in the beginning and 180.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 19:59:55,666 INFO L158 Benchmark]: TraceAbstraction took 8120.42ms. Allocated memory is still 219.2MB. Free memory was 179.7MB in the beginning and 104.8MB in the end (delta: 74.9MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. [2022-04-07 19:59:55,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 148.3MB in the beginning and 148.3MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.75ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 131.7MB in the beginning and 195.4MB in the end (delta: -63.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.97ms. Allocated memory is still 219.2MB. Free memory was 195.4MB in the beginning and 193.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.63ms. Allocated memory is still 219.2MB. Free memory was 193.8MB in the beginning and 182.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 30.05ms. Allocated memory is still 219.2MB. Free memory was 181.8MB in the beginning and 180.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8120.42ms. Allocated memory is still 219.2MB. Free memory was 179.7MB in the beginning and 104.8MB in the end (delta: 74.9MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [\old(counter)=0, A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L38] COND TRUE !(r >= d) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L44] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=3, counter++=2, d=2, p=2, q=0, r=1] [L44] COND FALSE !(counter++<2) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L58] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L59] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 849 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 533 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 316 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 7 NumberOfNonLiveVariables, 565 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 215/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 19:59:55,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...