/usr/bin/java -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/loop-acceleration/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:20:03,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:20:03,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:20:03,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:20:03,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:20:03,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:20:03,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:20:03,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:20:03,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:20:03,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:20:03,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:20:03,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:20:03,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:20:03,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:20:03,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:20:03,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:20:03,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:20:03,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:20:03,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:20:03,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:20:03,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:20:03,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:20:03,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:20:03,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:20:03,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:20:03,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:20:03,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:20:03,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:20:03,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:20:03,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:20:03,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:20:03,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:20:03,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:20:03,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:20:03,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:20:03,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:20:03,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:20:03,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:20:03,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:20:03,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:20:03,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:20:03,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:20:03,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:20:03,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:20:03,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:20:03,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:20:03,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:20:03,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:20:03,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:20:03,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:20:03,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:20:03,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:20:03,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:20:03,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:20:03,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:20:03,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:20:03,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:20:03,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:20:03,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:20:03,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:20:03,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:20:03,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:20:03,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:20:03,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:20:03,405 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-01-31 12:20:03,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:20:03,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:20:03,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:20:03,602 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:20:03,602 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:20:03,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-01-31 12:20:03,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3992a61c4/1bf69901dc054f42ac00a9608ecf7551/FLAG08a7ed539 [2022-01-31 12:20:04,032 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:20:04,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-01-31 12:20:04,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3992a61c4/1bf69901dc054f42ac00a9608ecf7551/FLAG08a7ed539 [2022-01-31 12:20:04,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3992a61c4/1bf69901dc054f42ac00a9608ecf7551 [2022-01-31 12:20:04,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:20:04,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:20:04,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:20:04,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:20:04,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:20:04,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04, skipping insertion in model container [2022-01-31 12:20:04,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:20:04,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:20:04,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c[325,338] [2022-01-31 12:20:04,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:20:04,215 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:20:04,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c[325,338] [2022-01-31 12:20:04,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:20:04,233 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:20:04,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04 WrapperNode [2022-01-31 12:20:04,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:20:04,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:20:04,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:20:04,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:20:04,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:20:04,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:20:04,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:20:04,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:20:04,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:20:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:20:04,304 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-01-31 12:20:04,306 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-01-31 12:20:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:20:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:20:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:20:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:20:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-01-31 12:20:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:20:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:20:04,381 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:20:04,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:20:04,464 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:20:04,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:20:04,469 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 12:20:04,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:20:04 BoogieIcfgContainer [2022-01-31 12:20:04,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:20:04,471 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:20:04,471 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:20:04,473 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:20:04,475 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:20:04" (1/1) ... [2022-01-31 12:20:04,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:20:04 BasicIcfg [2022-01-31 12:20:04,489 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:20:04,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:20:04,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:20:04,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:20:04,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:20:04" (1/4) ... [2022-01-31 12:20:04,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:20:04, skipping insertion in model container [2022-01-31 12:20:04,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:20:04" (2/4) ... [2022-01-31 12:20:04,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:20:04, skipping insertion in model container [2022-01-31 12:20:04,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:20:04" (3/4) ... [2022-01-31 12:20:04,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:20:04, skipping insertion in model container [2022-01-31 12:20:04,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:20:04" (4/4) ... [2022-01-31 12:20:04,504 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-2.cJordan [2022-01-31 12:20:04,508 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:20:04,508 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:20:04,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:20:04,541 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 12:20:04,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:20:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:20:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 12:20:04,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:20:04,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:20:04,558 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:20:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:20:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1565505021, now seen corresponding path program 1 times [2022-01-31 12:20:04,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:20:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006569561] [2022-01-31 12:20:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:04,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:20:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:20:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:20:04,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:20:04,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006569561] [2022-01-31 12:20:04,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006569561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:20:04,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:20:04,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:20:04,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152013681] [2022-01-31 12:20:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:20:04,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:20:04,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:20:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:20:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:20:04,770 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:20:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:20:04,812 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-01-31 12:20:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:20:04,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-31 12:20:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:20:04,819 INFO L225 Difference]: With dead ends: 23 [2022-01-31 12:20:04,819 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 12:20:04,821 INFO L932 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-01-31 12:20:04,823 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:20:04,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:20:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 12:20:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 12:20:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:20:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-01-31 12:20:04,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-01-31 12:20:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:20:04,852 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-01-31 12:20:04,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:20:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-01-31 12:20:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 12:20:04,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:20:04,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:20:04,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:20:04,854 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:20:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:20:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1564581500, now seen corresponding path program 1 times [2022-01-31 12:20:04,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:20:04,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774971525] [2022-01-31 12:20:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:04,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:20:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:20:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:20:04,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:20:04,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774971525] [2022-01-31 12:20:04,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774971525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:20:04,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:20:04,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 12:20:04,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539836363] [2022-01-31 12:20:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:20:04,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 12:20:04,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:20:04,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 12:20:04,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 12:20:04,917 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:20:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:20:04,963 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-01-31 12:20:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 12:20:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-31 12:20:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:20:04,965 INFO L225 Difference]: With dead ends: 20 [2022-01-31 12:20:04,965 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 12:20:04,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 12:20:04,967 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:20:04,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:20:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 12:20:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-01-31 12:20:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:20:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-01-31 12:20:04,973 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-01-31 12:20:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:20:04,973 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-01-31 12:20:04,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:20:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-01-31 12:20:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:20:04,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:20:04,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:20:04,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:20:04,974 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:20:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:20:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1890585047, now seen corresponding path program 1 times [2022-01-31 12:20:04,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:20:04,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522786394] [2022-01-31 12:20:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:04,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:20:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:05,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:20:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:05,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:20:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:20:05,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:20:05,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522786394] [2022-01-31 12:20:05,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522786394] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:20:05,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437060530] [2022-01-31 12:20:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:05,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:20:05,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:20:05,135 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-01-31 12:20:05,136 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-01-31 12:20:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:05,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:20:05,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:20:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:20:05,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:20:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:20:05,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437060530] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:20:05,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:20:05,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-01-31 12:20:05,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694536322] [2022-01-31 12:20:05,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:20:05,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 12:20:05,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:20:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 12:20:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:20:05,449 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:20:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:20:05,596 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-01-31 12:20:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:20:05,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-01-31 12:20:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:20:05,597 INFO L225 Difference]: With dead ends: 24 [2022-01-31 12:20:05,597 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 12:20:05,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:20:05,599 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:20:05,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:20:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 12:20:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-31 12:20:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:20:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-01-31 12:20:05,610 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-01-31 12:20:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:20:05,610 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-01-31 12:20:05,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:20:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-01-31 12:20:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 12:20:05,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:20:05,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:20:05,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 12:20:05,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:20:05,824 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:20:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:20:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1393393715, now seen corresponding path program 2 times [2022-01-31 12:20:05,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:20:05,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259469718] [2022-01-31 12:20:05,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:05,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:20:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:05,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:20:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:05,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:20:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 12:20:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 12:20:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 12:20:06,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:20:06,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259469718] [2022-01-31 12:20:06,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259469718] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:20:06,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680423908] [2022-01-31 12:20:06,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:20:06,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:20:06,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:20:06,034 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-01-31 12:20:06,035 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-01-31 12:20:06,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:20:06,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:20:06,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 12:20:06,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:20:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 12:20:06,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:20:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 12:20:06,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680423908] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:20:06,559 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:20:06,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 22 [2022-01-31 12:20:06,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096854700] [2022-01-31 12:20:06,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:20:06,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 12:20:06,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:20:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 12:20:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-01-31 12:20:06,562 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 12:20:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:20:07,047 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-01-31 12:20:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 12:20:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2022-01-31 12:20:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:20:07,049 INFO L225 Difference]: With dead ends: 36 [2022-01-31 12:20:07,049 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 12:20:07,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 12:20:07,050 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:20:07,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 12:20:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 12:20:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-31 12:20:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 12:20:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-01-31 12:20:07,057 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 29 [2022-01-31 12:20:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:20:07,057 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-01-31 12:20:07,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 12:20:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-01-31 12:20:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 12:20:07,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:20:07,058 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:20:07,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 12:20:07,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 12:20:07,268 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:20:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:20:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 638375751, now seen corresponding path program 3 times [2022-01-31 12:20:07,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:20:07,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988608816] [2022-01-31 12:20:07,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:07,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:20:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:20:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:20:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 12:20:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 12:20:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 12:20:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 12:20:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 12:20:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 12:20:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-31 12:20:07,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:20:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988608816] [2022-01-31 12:20:07,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988608816] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:20:07,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743262313] [2022-01-31 12:20:07,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:20:07,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:20:07,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:20:07,612 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-01-31 12:20:07,613 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-01-31 12:20:07,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-31 12:20:07,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:20:07,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 12:20:07,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:20:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-31 12:20:07,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:20:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 12:20:08,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743262313] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:20:08,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:20:08,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 42 [2022-01-31 12:20:08,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217387846] [2022-01-31 12:20:08,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:20:08,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 12:20:08,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:20:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 12:20:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 12:20:08,726 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 12:20:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:20:13,322 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-01-31 12:20:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 12:20:13,323 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 53 [2022-01-31 12:20:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:20:13,324 INFO L225 Difference]: With dead ends: 60 [2022-01-31 12:20:13,324 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 12:20:13,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=845, Invalid=4267, Unknown=0, NotChecked=0, Total=5112 [2022-01-31 12:20:13,326 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 12:20:13,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 148 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 12:20:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 12:20:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-01-31 12:20:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 12:20:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-01-31 12:20:13,334 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 53 [2022-01-31 12:20:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:20:13,334 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-01-31 12:20:13,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 12:20:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-01-31 12:20:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 12:20:13,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:20:13,337 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:20:13,369 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-01-31 12:20:13,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:20:13,558 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:20:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:20:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1561497967, now seen corresponding path program 4 times [2022-01-31 12:20:13,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:20:13,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555939961] [2022-01-31 12:20:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:20:13,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:20:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:20:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:20:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 12:20:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 12:20:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 12:20:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 12:20:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 12:20:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 12:20:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 12:20:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 12:20:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 12:20:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 12:20:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 12:20:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 12:20:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 12:20:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 12:20:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:20:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-01-31 12:20:14,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:20:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555939961] [2022-01-31 12:20:14,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555939961] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:20:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362446048] [2022-01-31 12:20:14,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:20:14,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:20:14,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:20:14,328 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-01-31 12:20:14,329 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-01-31 12:20:14,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:20:14,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:20:14,395 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 153 conjunts are in the unsatisfiable core [2022-01-31 12:20:14,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:20:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-01-31 12:20:15,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:20:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-31 12:20:17,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362446048] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:20:17,706 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:20:17,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 48] total 82 [2022-01-31 12:20:17,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103719688] [2022-01-31 12:20:17,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:20:17,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-31 12:20:17,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:20:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-31 12:20:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=5953, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 12:20:17,709 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-31 12:20:54,601 WARN L228 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 110 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:22:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:22:59,591 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-01-31 12:22:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 12:22:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 101 [2022-01-31 12:22:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:22:59,593 INFO L225 Difference]: With dead ends: 108 [2022-01-31 12:22:59,593 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 12:22:59,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 172 SyntacticMatches, 15 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 162.4s TimeCoverageRelationStatistics Valid=3099, Invalid=17490, Unknown=3, NotChecked=0, Total=20592 [2022-01-31 12:22:59,597 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 4200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:22:59,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 266 Invalid, 4200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 12:22:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 12:22:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-01-31 12:22:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-31 12:22:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2022-01-31 12:22:59,607 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 101 [2022-01-31 12:22:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:22:59,608 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2022-01-31 12:22:59,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-31 12:22:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-01-31 12:22:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-31 12:22:59,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:22:59,610 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:22:59,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-31 12:22:59,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:22:59,815 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:22:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:22:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1223308735, now seen corresponding path program 5 times [2022-01-31 12:22:59,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:22:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518073634] [2022-01-31 12:22:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:22:59,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:22:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:23:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:23:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 12:23:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 12:23:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 12:23:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 12:23:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 12:23:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 12:23:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 12:23:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 12:23:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 12:23:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 12:23:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 12:23:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 12:23:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 12:23:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 12:23:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 12:23:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 12:23:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 12:23:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 12:23:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-31 12:23:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-31 12:23:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 12:23:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 12:23:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-31 12:23:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 12:23:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 12:23:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 12:23:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-31 12:23:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-31 12:23:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 12:23:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-31 12:23:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:23:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-01-31 12:23:01,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:23:01,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518073634] [2022-01-31 12:23:01,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518073634] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:23:01,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386632922] [2022-01-31 12:23:01,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 12:23:01,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:23:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:23:01,889 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-01-31 12:23:01,890 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-01-31 12:23:17,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-01-31 12:23:17,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:23:17,508 WARN L261 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 313 conjunts are in the unsatisfiable core [2022-01-31 12:23:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:23:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-01-31 12:23:19,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:23:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-31 12:23:28,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386632922] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:23:28,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:23:28,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 96] total 162 [2022-01-31 12:23:28,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712280220] [2022-01-31 12:23:28,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:23:28,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-01-31 12:23:28,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:23:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-01-31 12:23:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2401, Invalid=23681, Unknown=0, NotChecked=0, Total=26082 [2022-01-31 12:23:28,499 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 162 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 99 states have internal predecessors, (200), 64 states have call successors, (66), 3 states have call predecessors, (66), 33 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-01-31 12:24:55,850 WARN L228 SmtUtils]: Spent 8.00s on a formula simplification. DAG size of input: 136 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:26:27,082 WARN L228 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 132 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:26:29,403 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 56 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 58) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 12:27:59,196 WARN L228 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 122 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:32:05,016 WARN L228 SmtUtils]: Spent 32.11s on a formula simplification. DAG size of input: 215 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:33:24,966 WARN L228 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 124 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:33:27,145 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false