/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/loops-crafted-1/Mono1_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:04:02,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:04:02,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:04:02,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:04:02,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:04:02,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:04:02,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:04:02,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:04:02,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:04:02,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:04:02,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:04:02,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:04:02,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:04:02,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:04:02,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:04:02,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:04:02,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:04:02,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:04:02,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:04:02,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:04:02,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:04:02,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:04:02,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:04:02,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:04:02,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:04:02,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:04:02,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:04:02,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:04:02,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:04:02,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:04:02,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:04:02,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:04:02,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:04:02,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:04:02,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:04:02,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:04:02,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:04:02,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:04:02,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:04:02,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:04:02,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:04:02,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:04:02,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:04:02,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:04:02,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:04:02,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:04:02,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:04:02,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:04:02,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:04:02,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:04:02,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:04:02,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:04:02,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:04:02,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:04:02,199 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:04:02,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:04:02,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:04:02,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:04:02,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:04:02,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:04:02,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:04:02,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:04:02,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:04:02,200 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:04:02,201 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-02-14 21:04:02,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:04:02,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:04:02,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:04:02,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:04:02,404 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:04:02,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-02-14 21:04:02,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42e10b72/885fa6c2bce14551ac3b8daecafad361/FLAGe15f7e021 [2022-02-14 21:04:02,804 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:04:02,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-02-14 21:04:02,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42e10b72/885fa6c2bce14551ac3b8daecafad361/FLAGe15f7e021 [2022-02-14 21:04:02,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42e10b72/885fa6c2bce14551ac3b8daecafad361 [2022-02-14 21:04:02,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:04:02,830 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:04:02,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:04:02,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:04:02,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:04:02,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:04:02" (1/1) ... [2022-02-14 21:04:02,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f28c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:02, skipping insertion in model container [2022-02-14 21:04:02,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:04:02" (1/1) ... [2022-02-14 21:04:02,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:04:02,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:04:02,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c[313,326] [2022-02-14 21:04:02,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:04:02,986 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:04:02,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c[313,326] [2022-02-14 21:04:02,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:04:03,003 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:04:03,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03 WrapperNode [2022-02-14 21:04:03,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:04:03,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:04:03,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:04:03,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:04:03,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:04:03,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:04:03,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:04:03,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:04:03,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:04:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:03,056 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-02-14 21:04:03,067 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-02-14 21:04:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:04:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:04:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:04:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:04:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:04:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:04:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:04:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:04:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:04:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:04:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:04:03,136 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:04:03,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:04:03,234 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:04:03,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:04:03,238 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-14 21:04:03,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:04:03 BoogieIcfgContainer [2022-02-14 21:04:03,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:04:03,240 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:04:03,240 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:04:03,242 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:04:03,244 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:04:03" (1/1) ... [2022-02-14 21:04:03,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:04:03 BasicIcfg [2022-02-14 21:04:03,255 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:04:03,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:04:03,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:04:03,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:04:03,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:04:02" (1/4) ... [2022-02-14 21:04:03,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6994065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:04:03, skipping insertion in model container [2022-02-14 21:04:03,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:03" (2/4) ... [2022-02-14 21:04:03,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6994065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:04:03, skipping insertion in model container [2022-02-14 21:04:03,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:04:03" (3/4) ... [2022-02-14 21:04:03,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6994065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:04:03, skipping insertion in model container [2022-02-14 21:04:03,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:04:03" (4/4) ... [2022-02-14 21:04:03,262 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.cJordan [2022-02-14 21:04:03,266 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:04:03,266 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:04:03,301 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:04:03,306 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-02-14 21:04:03,307 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:04:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:04:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:04:03,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:03,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:03,330 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-02-14 21:04:03,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:03,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675379345] [2022-02-14 21:04:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:03,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:03,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675379345] [2022-02-14 21:04:03,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675379345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:04:03,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:04:03,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:04:03,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589441389] [2022-02-14 21:04:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:04:03,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:04:03,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:04:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:04:03,507 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-02-14 21:04:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:03,549 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-14 21:04:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:04:03,551 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-02-14 21:04:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:03,555 INFO L225 Difference]: With dead ends: 19 [2022-02-14 21:04:03,555 INFO L226 Difference]: Without dead ends: 13 [2022-02-14 21:04:03,556 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-02-14 21:04:03,558 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:03,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:04:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-14 21:04:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-14 21:04:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-14 21:04:03,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-02-14 21:04:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:03,579 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-14 21:04:03,580 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-02-14 21:04:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-14 21:04:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:04:03,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:03,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:03,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:04:03,581 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-02-14 21:04:03,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:03,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773876391] [2022-02-14 21:04:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:03,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:03,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773876391] [2022-02-14 21:04:03,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773876391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:04:03,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:04:03,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:04:03,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206731145] [2022-02-14 21:04:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:04:03,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:04:03,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:03,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:04:03,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:04:03,722 INFO L87 Difference]: Start difference. First operand 13 states and 14 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-02-14 21:04:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:03,754 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-14 21:04:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:04:03,755 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-02-14 21:04:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:03,756 INFO L225 Difference]: With dead ends: 15 [2022-02-14 21:04:03,756 INFO L226 Difference]: Without dead ends: 15 [2022-02-14 21:04:03,759 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-02-14 21:04:03,760 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:03,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:04:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-14 21:04:03,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-14 21:04:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-14 21:04:03,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-02-14 21:04:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:03,763 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-14 21:04:03,763 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-02-14 21:04:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-14 21:04:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-14 21:04:03,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:03,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:03,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:04:03,767 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-02-14 21:04:03,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:03,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643625010] [2022-02-14 21:04:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:03,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:03,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643625010] [2022-02-14 21:04:03,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643625010] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:03,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289942203] [2022-02-14 21:04:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:03,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:03,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:03,847 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-02-14 21:04:03,848 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-02-14 21:04:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:03,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:04:03,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:03,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:03,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289942203] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:03,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:03,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-02-14 21:04:03,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089523998] [2022-02-14 21:04:03,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:03,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:04:03,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:04:03,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-14 21:04:03,965 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:04,040 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-14 21:04:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:04:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-14 21:04:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:04,040 INFO L225 Difference]: With dead ends: 19 [2022-02-14 21:04:04,040 INFO L226 Difference]: Without dead ends: 19 [2022-02-14 21:04:04,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-02-14 21:04:04,041 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:04,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:04:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-14 21:04:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-14 21:04:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-14 21:04:04,044 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-02-14 21:04:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:04,044 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-14 21:04:04,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-14 21:04:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:04:04,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:04,045 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:04,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-14 21:04:04,269 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-02-14 21:04:04,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-02-14 21:04:04,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:04,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617302608] [2022-02-14 21:04:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:04,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:04,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617302608] [2022-02-14 21:04:04,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617302608] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:04,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263828596] [2022-02-14 21:04:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:04,355 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-02-14 21:04:04,383 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-02-14 21:04:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:04,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:04:04,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:04,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:04,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263828596] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:04,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:04,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-02-14 21:04:04,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657328090] [2022-02-14 21:04:04,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:04,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-14 21:04:04,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-14 21:04:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:04:04,560 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:04,734 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-14 21:04:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:04:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 21:04:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:04,735 INFO L225 Difference]: With dead ends: 26 [2022-02-14 21:04:04,735 INFO L226 Difference]: Without dead ends: 26 [2022-02-14 21:04:04,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:04:04,736 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:04,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:04:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-14 21:04:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-14 21:04:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-14 21:04:04,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-02-14 21:04:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:04,740 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-14 21:04:04,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-14 21:04:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-14 21:04:04,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:04,741 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:04,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-14 21:04:04,951 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-02-14 21:04:04,952 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-02-14 21:04:04,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:04,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234476127] [2022-02-14 21:04:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:05,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:05,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234476127] [2022-02-14 21:04:05,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234476127] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:05,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192040019] [2022-02-14 21:04:05,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:04:05,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:05,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:05,119 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-02-14 21:04:05,120 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-02-14 21:04:05,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:04:05,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:05,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-14 21:04:05,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:05,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:05,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192040019] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:05,529 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:05,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-02-14 21:04:05,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072298642] [2022-02-14 21:04:05,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:05,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-14 21:04:05,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-14 21:04:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-02-14 21:04:05,530 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:06,585 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-14 21:04:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-14 21:04:06,585 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-14 21:04:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:06,586 INFO L225 Difference]: With dead ends: 39 [2022-02-14 21:04:06,586 INFO L226 Difference]: Without dead ends: 36 [2022-02-14 21:04:06,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-02-14 21:04:06,588 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:06,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-14 21:04:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-14 21:04:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-14 21:04:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-02-14 21:04:06,595 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-02-14 21:04:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:06,595 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-02-14 21:04:06,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-14 21:04:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-14 21:04:06,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:06,596 INFO L514 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:06,614 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-02-14 21:04:06,796 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-02-14 21:04:06,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-02-14 21:04:06,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:06,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807814498] [2022-02-14 21:04:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:06,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-14 21:04:06,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:06,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807814498] [2022-02-14 21:04:06,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807814498] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:06,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853470227] [2022-02-14 21:04:06,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:04:06,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:06,924 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-02-14 21:04:06,925 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-02-14 21:04:06,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-02-14 21:04:06,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:06,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-14 21:04:07,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-14 21:04:07,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-14 21:04:07,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853470227] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:07,733 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:07,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-02-14 21:04:07,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503021559] [2022-02-14 21:04:07,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:07,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-14 21:04:07,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-14 21:04:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-02-14 21:04:07,736 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:14,618 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-14 21:04:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-14 21:04:14,619 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-02-14 21:04:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:14,619 INFO L225 Difference]: With dead ends: 57 [2022-02-14 21:04:14,619 INFO L226 Difference]: Without dead ends: 54 [2022-02-14 21:04:14,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=699, Invalid=2381, Unknown=0, NotChecked=0, Total=3080 [2022-02-14 21:04:14,621 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:14,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 56 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-14 21:04:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-14 21:04:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-02-14 21:04:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-02-14 21:04:14,625 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-02-14 21:04:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:14,625 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-02-14 21:04:14,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-14 21:04:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-14 21:04:14,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:14,626 INFO L514 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:14,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-14 21:04:14,844 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-02-14 21:04:14,844 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-02-14 21:04:14,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:14,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480978031] [2022-02-14 21:04:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-14 21:04:15,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:15,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480978031] [2022-02-14 21:04:15,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480978031] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:15,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026499944] [2022-02-14 21:04:15,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 21:04:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:15,036 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-02-14 21:04:15,037 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-02-14 21:04:15,077 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 21:04:15,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:15,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-14 21:04:15,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-14 21:04:15,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-14 21:04:16,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026499944] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:16,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:16,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-02-14 21:04:16,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090718698] [2022-02-14 21:04:16,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:16,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-14 21:04:16,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-14 21:04:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-02-14 21:04:16,036 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:41,368 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-02-14 21:04:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-14 21:04:41,368 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-02-14 21:04:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:41,369 INFO L225 Difference]: With dead ends: 86 [2022-02-14 21:04:41,369 INFO L226 Difference]: Without dead ends: 86 [2022-02-14 21:04:41,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-02-14 21:04:41,371 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:41,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 99 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-14 21:04:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-14 21:04:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-14 21:04:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-02-14 21:04:41,376 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-02-14 21:04:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:41,376 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-02-14 21:04:41,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-02-14 21:04:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-14 21:04:41,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:41,377 INFO L514 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:41,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-14 21:04:41,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:41,596 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-02-14 21:04:41,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:41,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183590933] [2022-02-14 21:04:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-14 21:04:42,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:42,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183590933] [2022-02-14 21:04:42,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183590933] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:42,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459076461] [2022-02-14 21:04:42,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-14 21:04:42,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:42,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:04:42,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-14 21:04:50,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-02-14 21:04:50,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:50,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-14 21:04:50,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 493 proven. 812 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-14 21:04:50,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 493 proven. 812 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-14 21:04:52,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459076461] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:52,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:52,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 32] total 63 [2022-02-14 21:04:52,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976117228] [2022-02-14 21:04:52,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:52,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-02-14 21:04:52,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-02-14 21:04:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2856, Unknown=0, NotChecked=0, Total=3906 [2022-02-14 21:04:52,838 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:24,204 WARN L228 SmtUtils]: Spent 12.27s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:05:26,222 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ c_main_~x~0 11) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse25 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000))))) is different from false [2022-02-14 21:06:16,573 WARN L228 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 195 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:06:39,769 WARN L228 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:10:28,594 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod c_main_~x~0 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ c_main_~x~0 11) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse27 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000))))) is different from false [2022-02-14 21:10:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:10:28,621 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2022-02-14 21:10:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-14 21:10:28,621 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-02-14 21:10:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:10:28,622 INFO L225 Difference]: With dead ends: 146 [2022-02-14 21:10:28,622 INFO L226 Difference]: Without dead ends: 146 [2022-02-14 21:10:28,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 336.9s TimeCoverageRelationStatistics Valid=3672, Invalid=10132, Unknown=10, NotChecked=466, Total=14280 [2022-02-14 21:10:28,625 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-14 21:10:28,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 193 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1676 Invalid, 0 Unknown, 2 Unchecked, 0.8s Time] [2022-02-14 21:10:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-14 21:10:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-02-14 21:10:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0567375886524824) internal successors, (149), 141 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:10:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2022-02-14 21:10:28,632 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 85 [2022-02-14 21:10:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:10:28,632 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2022-02-14 21:10:28,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:10:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2022-02-14 21:10:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-14 21:10:28,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:10:28,633 INFO L514 BasicCegarLoop]: trace histogram [67, 55, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:10:28,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-14 21:10:28,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:10:28,840 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:10:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:10:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 729081652, now seen corresponding path program 6 times [2022-02-14 21:10:28,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:10:28,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889110385] [2022-02-14 21:10:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:10:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:10:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:10:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:10:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:10:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1288 proven. 3080 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-14 21:10:30,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:10:30,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889110385] [2022-02-14 21:10:30,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889110385] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:10:30,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370264847] [2022-02-14 21:10:30,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-14 21:10:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:10:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:10:30,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:10:30,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-14 21:10:48,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-02-14 21:10:48,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:10:48,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-02-14 21:10:48,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:10:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1375 proven. 144 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2022-02-14 21:10:49,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:10:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1375 proven. 144 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2022-02-14 21:10:52,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370264847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:10:52,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:10:52,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 15, 19] total 89 [2022-02-14 21:10:52,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637496202] [2022-02-14 21:10:52,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:10:52,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-02-14 21:10:52,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:10:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-02-14 21:10:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=6568, Unknown=0, NotChecked=0, Total=7832 [2022-02-14 21:10:52,644 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:11:32,537 WARN L228 SmtUtils]: Spent 19.17s on a formula simplification. DAG size of input: 98 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:11:52,846 WARN L228 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:12:16,266 WARN L228 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 91 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:12:31,991 WARN L228 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:12:49,404 WARN L228 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:13:15,435 WARN L228 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:14:22,492 WARN L228 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:14:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:14:22,522 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2022-02-14 21:14:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-02-14 21:14:22,523 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-02-14 21:14:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:14:22,524 INFO L225 Difference]: With dead ends: 179 [2022-02-14 21:14:22,524 INFO L226 Difference]: Without dead ends: 176 [2022-02-14 21:14:22,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 197.6s TimeCoverageRelationStatistics Valid=4978, Invalid=29431, Unknown=1, NotChecked=0, Total=34410 [2022-02-14 21:14:22,529 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 344 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 8885 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 9702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 8885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-02-14 21:14:22,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 121 Invalid, 9702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [817 Valid, 8885 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2022-02-14 21:14:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-14 21:14:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-02-14 21:14:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.087719298245614) internal successors, (186), 171 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:14:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2022-02-14 21:14:22,549 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 145 [2022-02-14 21:14:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:14:22,549 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2022-02-14 21:14:22,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:14:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-02-14 21:14:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-02-14 21:14:22,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:14:22,551 INFO L514 BasicCegarLoop]: trace histogram [82, 56, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:14:22,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-14 21:14:22,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:14:22,752 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:14:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:14:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2146523672, now seen corresponding path program 7 times [2022-02-14 21:14:22,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:14:22,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778215937] [2022-02-14 21:14:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:14:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:14:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:14:24,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:14:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:14:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 2907 proven. 3192 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-02-14 21:14:24,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:14:24,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778215937] [2022-02-14 21:14:24,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778215937] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:14:24,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647369142] [2022-02-14 21:14:24,181 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-14 21:14:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:14:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:14:24,183 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:14:24,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-14 21:14:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:14:24,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 156 conjunts are in the unsatisfiable core [2022-02-14 21:14:24,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:14:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 847 proven. 5852 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-14 21:14:25,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:14:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 847 proven. 5852 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-14 21:14:36,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647369142] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:14:36,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:14:36,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 79, 80] total 159 [2022-02-14 21:14:36,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449964813] [2022-02-14 21:14:36,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:14:36,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-02-14 21:14:36,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:14:36,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-02-14 21:14:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6457, Invalid=18665, Unknown=0, NotChecked=0, Total=25122 [2022-02-14 21:14:36,683 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand has 159 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 158 states have internal predecessors, (322), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:14:42,326 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000)))) (let ((.cse56 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000)))) (let ((.cse59 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (not (< .cse59 100000000)))) (let ((.cse60 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse60 100000000)) (< .cse60 10000000))) (let ((.cse61 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse61 100000000)) (< .cse61 10000000))) (let ((.cse62 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse62 100000000)) (< .cse62 10000000))) (let ((.cse63 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse63 10000000) (not (< .cse63 100000000)))) (let ((.cse64 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse64 10000000) (not (< .cse64 100000000)))) (let ((.cse65 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse65 10000000) (not (< .cse65 100000000)))) (let ((.cse66 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse66 100000000)) (< .cse66 10000000))) (let ((.cse67 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse67 10000000) (not (< .cse67 100000000)))) (let ((.cse68 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse68 100000000)) (< .cse68 10000000))) (let ((.cse69 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse69 10000000) (not (< .cse69 100000000)))) (let ((.cse70 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse70 100000000)) (< .cse70 10000000))) (let ((.cse71 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse71 100000000)) (< .cse71 10000000))) (let ((.cse72 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse72 100000000)) (< .cse72 10000000))) (let ((.cse73 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse73 100000000)) (< .cse73 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse74 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse74 10000000) (not (< .cse74 100000000)))) (let ((.cse75 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse75 10000000) (not (< .cse75 100000000))))) is different from false [2022-02-14 21:14:44,342 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000)))) (let ((.cse56 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000)))) (let ((.cse59 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (not (< .cse59 100000000)))) (let ((.cse60 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse60 100000000)) (< .cse60 10000000))) (let ((.cse61 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse61 100000000)) (< .cse61 10000000))) (let ((.cse62 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse62 100000000)) (< .cse62 10000000))) (let ((.cse63 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse63 10000000) (not (< .cse63 100000000)))) (let ((.cse64 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse64 10000000) (not (< .cse64 100000000)))) (let ((.cse65 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse65 10000000) (not (< .cse65 100000000)))) (let ((.cse66 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse66 100000000)) (< .cse66 10000000))) (let ((.cse67 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse67 10000000) (not (< .cse67 100000000)))) (let ((.cse68 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse68 100000000)) (< .cse68 10000000))) (let ((.cse69 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse69 10000000) (not (< .cse69 100000000)))) (let ((.cse70 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse70 100000000)) (< .cse70 10000000))) (let ((.cse71 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse71 100000000)) (< .cse71 10000000))) (let ((.cse72 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse72 100000000)) (< .cse72 10000000))) (let ((.cse73 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse73 100000000)) (< .cse73 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse74 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse74 10000000) (not (< .cse74 100000000)))) (let ((.cse75 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse75 10000000) (not (< .cse75 100000000))))) is different from false [2022-02-14 21:14:46,361 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000)))) (let ((.cse46 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (not (< .cse49 100000000)))) (let ((.cse50 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (not (< .cse51 100000000)))) (let ((.cse52 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000))))) is different from false