/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 00:42:26,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 00:42:26,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 00:42:26,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 00:42:26,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 00:42:26,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 00:42:26,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 00:42:26,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 00:42:26,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 00:42:26,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 00:42:26,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 00:42:26,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 00:42:26,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 00:42:26,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 00:42:26,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 00:42:26,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 00:42:26,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 00:42:26,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 00:42:26,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 00:42:26,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 00:42:26,230 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 00:42:26,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 00:42:26,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 00:42:26,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 00:42:26,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 00:42:26,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 00:42:26,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 00:42:26,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 00:42:26,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 00:42:26,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 00:42:26,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 00:42:26,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 00:42:26,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 00:42:26,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 00:42:26,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 00:42:26,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 00:42:26,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 00:42:26,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 00:42:26,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 00:42:26,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 00:42:26,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 00:42:26,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 00:42:26,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 00:42:26,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 00:42:26,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 00:42:26,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 00:42:26,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 00:42:26,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 00:42:26,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 00:42:26,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 00:42:26,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 00:42:26,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 00:42:26,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 00:42:26,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 00:42:26,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 00:42:26,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 00:42:26,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 00:42:26,263 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 00:42:26,263 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 00:42:26,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 00:42:26,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 00:42:26,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 00:42:26,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 00:42:26,459 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 00:42:26,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-05 00:42:26,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e899720d5/22c6c095151a410f9276d7aac8f285d8/FLAG728e147a9 [2022-04-05 00:42:26,882 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 00:42:26,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-05 00:42:26,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e899720d5/22c6c095151a410f9276d7aac8f285d8/FLAG728e147a9 [2022-04-05 00:42:26,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e899720d5/22c6c095151a410f9276d7aac8f285d8 [2022-04-05 00:42:26,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 00:42:26,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 00:42:26,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 00:42:26,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 00:42:26,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 00:42:26,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:42:26" (1/1) ... [2022-04-05 00:42:26,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c6ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:26, skipping insertion in model container [2022-04-05 00:42:26,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:42:26" (1/1) ... [2022-04-05 00:42:26,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 00:42:26,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 00:42:27,060 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-2.c[313,326] [2022-04-05 00:42:27,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 00:42:27,078 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 00:42:27,087 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-2.c[313,326] [2022-04-05 00:42:27,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 00:42:27,101 INFO L208 MainTranslator]: Completed translation [2022-04-05 00:42:27,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27 WrapperNode [2022-04-05 00:42:27,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 00:42:27,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 00:42:27,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 00:42:27,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 00:42:27,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 00:42:27,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 00:42:27,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 00:42:27,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 00:42:27,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 00:42:27,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:42:27,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 00:42:27,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 00:42:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 00:42:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 00:42:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 00:42:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 00:42:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 00:42:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 00:42:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 00:42:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 00:42:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 00:42:27,254 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 00:42:27,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 00:42:27,335 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 00:42:27,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 00:42:27,339 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 00:42:27,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:42:27 BoogieIcfgContainer [2022-04-05 00:42:27,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 00:42:27,340 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 00:42:27,341 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 00:42:27,341 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 00:42:27,343 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:42:27" (1/1) ... [2022-04-05 00:42:27,345 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 00:42:27,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 12:42:27 BasicIcfg [2022-04-05 00:42:27,353 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 00:42:27,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 00:42:27,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 00:42:27,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 00:42:27,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 12:42:26" (1/4) ... [2022-04-05 00:42:27,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c37f663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:42:27, skipping insertion in model container [2022-04-05 00:42:27,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:42:27" (2/4) ... [2022-04-05 00:42:27,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c37f663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:42:27, skipping insertion in model container [2022-04-05 00:42:27,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:42:27" (3/4) ... [2022-04-05 00:42:27,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c37f663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:42:27, skipping insertion in model container [2022-04-05 00:42:27,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 12:42:27" (4/4) ... [2022-04-05 00:42:27,357 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.cJordan [2022-04-05 00:42:27,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 00:42:27,361 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 00:42:27,387 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 00:42:27,391 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 00:42:27,391 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 00:42:27,399 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-04-05 00:42:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 00:42:27,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:27,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:27,404 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-05 00:42:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:27,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412673818] [2022-04-05 00:42:27,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:27,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412673818] [2022-04-05 00:42:27,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412673818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:42:27,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:42:27,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 00:42:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084007628] [2022-04-05 00:42:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:42:27,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 00:42:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 00:42:27,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 00:42:27,622 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-04-05 00:42:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:42:27,653 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-05 00:42:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 00:42:27,655 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-04-05 00:42:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:42:27,660 INFO L225 Difference]: With dead ends: 19 [2022-04-05 00:42:27,660 INFO L226 Difference]: Without dead ends: 13 [2022-04-05 00:42:27,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 00:42:27,666 INFO L913 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-04-05 00:42:27,667 INFO L914 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-04-05 00:42:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-05 00:42:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-05 00:42:27,687 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-04-05 00:42:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-05 00:42:27,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-05 00:42:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:42:27,689 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-05 00:42:27,689 INFO L479 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-04-05 00:42:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-05 00:42:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 00:42:27,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:27,690 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:27,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 00:42:27,690 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-05 00:42:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:27,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515717678] [2022-04-05 00:42:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515717678] [2022-04-05 00:42:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515717678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:42:27,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:42:27,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:42:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105837004] [2022-04-05 00:42:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:42:27,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:42:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:27,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:42:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:42:27,813 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-04-05 00:42:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:42:27,844 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-05 00:42:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:42:27,845 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-04-05 00:42:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:42:27,845 INFO L225 Difference]: With dead ends: 15 [2022-04-05 00:42:27,845 INFO L226 Difference]: Without dead ends: 15 [2022-04-05 00:42:27,848 INFO L912 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-04-05 00:42:27,849 INFO L913 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-04-05 00:42:27,849 INFO L914 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-04-05 00:42:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-05 00:42:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-05 00:42:27,854 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-04-05 00:42:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-05 00:42:27,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-05 00:42:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:42:27,855 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-05 00:42:27,856 INFO L479 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-04-05 00:42:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-05 00:42:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-05 00:42:27,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:27,859 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:27,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 00:42:27,861 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-05 00:42:27,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:27,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950408484] [2022-04-05 00:42:27,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:27,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950408484] [2022-04-05 00:42:27,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950408484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:42:27,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045045053] [2022-04-05 00:42:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:27,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:42:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:42:27,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:42:28,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 00:42:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:28,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 00:42:28,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:42:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:28,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:42:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:28,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045045053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:42:28,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:42:28,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-05 00:42:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100959384] [2022-04-05 00:42:28,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:42:28,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 00:42:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 00:42:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-05 00:42:28,219 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-04-05 00:42:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:42:28,304 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-05 00:42:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 00:42:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 13 [2022-04-05 00:42:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:42:28,305 INFO L225 Difference]: With dead ends: 18 [2022-04-05 00:42:28,305 INFO L226 Difference]: Without dead ends: 18 [2022-04-05 00:42:28,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-05 00:42:28,306 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 00:42:28,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 00:42:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-05 00:42:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-05 00:42:28,308 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-04-05 00:42:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-05 00:42:28,308 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-05 00:42:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:42:28,308 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-05 00:42:28,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-04-05 00:42:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-05 00:42:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 00:42:28,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:28,309 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:28,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-05 00:42:28,531 WARN L460 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-04-05 00:42:28,531 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-04-05 00:42:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:28,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132253098] [2022-04-05 00:42:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:28,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:28,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132253098] [2022-04-05 00:42:28,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132253098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:42:28,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510399077] [2022-04-05 00:42:28,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:28,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:42:28,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:42:28,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:42:28,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 00:42:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:28,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 00:42:28,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:42:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:28,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:42:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:28,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510399077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:42:28,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:42:28,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-05 00:42:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828591477] [2022-04-05 00:42:28,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:42:28,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 00:42:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 00:42:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-05 00:42:28,819 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-04-05 00:42:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:42:29,002 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-05 00:42:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 00:42:29,002 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-04-05 00:42:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:42:29,003 INFO L225 Difference]: With dead ends: 26 [2022-04-05 00:42:29,003 INFO L226 Difference]: Without dead ends: 26 [2022-04-05 00:42:29,003 INFO L912 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-04-05 00:42:29,004 INFO L913 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-04-05 00:42:29,004 INFO L914 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-04-05 00:42:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-05 00:42:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-05 00:42:29,006 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-04-05 00:42:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-05 00:42:29,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-04-05 00:42:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:42:29,007 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-05 00:42:29,007 INFO L479 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-04-05 00:42:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-05 00:42:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-05 00:42:29,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:29,008 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:29,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-05 00:42:29,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-05 00:42:29,219 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-04-05 00:42:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:29,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328420699] [2022-04-05 00:42:29,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:29,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328420699] [2022-04-05 00:42:29,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328420699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:42:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302780616] [2022-04-05 00:42:29,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 00:42:29,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:42:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:42:29,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:42:29,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 00:42:29,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 00:42:29,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:42:29,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-05 00:42:29,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:42:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:29,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:42:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:42:29,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302780616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:42:29,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:42:29,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-04-05 00:42:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99068151] [2022-04-05 00:42:29,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:42:29,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-05 00:42:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-05 00:42:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-04-05 00:42:29,800 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-04-05 00:42:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:42:31,085 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-05 00:42:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-05 00:42:31,085 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-04-05 00:42:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:42:31,087 INFO L225 Difference]: With dead ends: 39 [2022-04-05 00:42:31,087 INFO L226 Difference]: Without dead ends: 36 [2022-04-05 00:42:31,088 INFO L912 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-04-05 00:42:31,088 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:42:31,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 00:42:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-05 00:42:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-05 00:42:31,094 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-04-05 00:42:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-05 00:42:31,094 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-04-05 00:42:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:42:31,095 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-05 00:42:31,095 INFO L479 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-04-05 00:42:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-05 00:42:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-05 00:42:31,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:31,096 INFO L499 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:31,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 00:42:31,314 WARN L460 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-04-05 00:42:31,314 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-04-05 00:42:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:31,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129583174] [2022-04-05 00:42:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-05 00:42:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:31,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129583174] [2022-04-05 00:42:31,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129583174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:42:31,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458898955] [2022-04-05 00:42:31,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 00:42:31,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:42:31,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:42:31,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:42:31,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 00:42:31,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-05 00:42:31,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:42:31,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-05 00:42:31,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:42:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-05 00:42:31,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:42:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-05 00:42:32,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458898955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:42:32,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:42:32,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-04-05 00:42:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157511547] [2022-04-05 00:42:32,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:42:32,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-05 00:42:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-05 00:42:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-04-05 00:42:32,359 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-04-05 00:42:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:42:35,288 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-05 00:42:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-05 00:42:35,288 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-04-05 00:42:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:42:35,291 INFO L225 Difference]: With dead ends: 57 [2022-04-05 00:42:35,291 INFO L226 Difference]: Without dead ends: 54 [2022-04-05 00:42:35,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2022-04-05 00:42:35,294 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 00:42:35,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 66 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 00:42:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-05 00:42:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-05 00:42:35,308 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-04-05 00:42:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-05 00:42:35,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-04-05 00:42:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:42:35,309 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-05 00:42:35,309 INFO L479 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-04-05 00:42:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-05 00:42:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 00:42:35,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:42:35,310 INFO L499 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:42:35,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 00:42:35,511 WARN L460 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-04-05 00:42:35,511 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:42:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:42:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-04-05 00:42:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:42:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791027349] [2022-04-05 00:42:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:42:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:42:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:42:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:42:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-05 00:42:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:42:35,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791027349] [2022-04-05 00:42:35,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791027349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:42:35,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043654312] [2022-04-05 00:42:35,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 00:42:35,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:42:35,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:42:35,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:42:35,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 00:42:35,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 00:42:35,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:42:35,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-05 00:42:35,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:42:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-05 00:42:35,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:42:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-05 00:42:36,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043654312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:42:36,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:42:36,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-04-05 00:42:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567038622] [2022-04-05 00:42:36,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:42:36,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-05 00:42:36,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:42:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-05 00:42:36,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-04-05 00:42:36,725 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-04-05 00:43:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:43:07,186 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-05 00:43:07,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-05 00:43:07,186 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-04-05 00:43:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:43:07,187 INFO L225 Difference]: With dead ends: 86 [2022-04-05 00:43:07,187 INFO L226 Difference]: Without dead ends: 86 [2022-04-05 00:43:07,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-04-05 00:43:07,188 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:43:07,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 104 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 00:43:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-05 00:43:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-05 00:43:07,192 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-04-05 00:43:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-05 00:43:07,193 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-04-05 00:43:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:43:07,193 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-05 00:43:07,193 INFO L479 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-04-05 00:43:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-05 00:43:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-05 00:43:07,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:43:07,195 INFO L499 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:43:07,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-05 00:43:07,395 WARN L460 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-04-05 00:43:07,395 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:43:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:43:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-04-05 00:43:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:43:07,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077436334] [2022-04-05 00:43:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:43:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:43:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:43:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:43:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:43:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-05 00:43:07,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:43:07,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077436334] [2022-04-05 00:43:07,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077436334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:43:07,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267384112] [2022-04-05 00:43:07,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 00:43:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:43:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:43:07,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:43:07,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 00:43:16,223 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-04-05 00:43:16,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:43:16,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-05 00:43:16,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:43:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 00:43:16,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:43:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 00:43:18,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267384112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:43:18,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:43:18,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34, 35] total 69 [2022-04-05 00:43:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922317968] [2022-04-05 00:43:18,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:43:18,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-05 00:43:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:43:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-05 00:43:18,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=3441, Unknown=0, NotChecked=0, Total=4692 [2022-04-05 00:43:18,918 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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-04-05 00:43:55,226 WARN L232 SmtUtils]: Spent 13.74s on a formula simplification. DAG size of input: 230 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:44:26,741 WARN L232 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 223 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:45:00,139 WARN L232 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 216 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:45:44,805 WARN L232 SmtUtils]: Spent 14.40s 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-04-05 00:46:17,524 WARN L232 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 202 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:46:51,244 WARN L232 SmtUtils]: Spent 5.40s 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-04-05 00:47:19,194 WARN L232 SmtUtils]: Spent 6.95s 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-04-05 00:48:15,256 WARN L232 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 174 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:53:12,063 WARN L232 SmtUtils]: Spent 30.37s on a formula simplification. DAG size of input: 233 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:53:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:53:12,137 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-04-05 00:53:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-05 00:53:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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-04-05 00:53:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:53:12,138 INFO L225 Difference]: With dead ends: 152 [2022-04-05 00:53:12,139 INFO L226 Difference]: Without dead ends: 152 [2022-04-05 00:53:12,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 594.4s TimeCoverageRelationStatistics Valid=4276, Invalid=11960, Unknown=20, NotChecked=0, Total=16256 [2022-04-05 00:53:12,142 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 124 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-05 00:53:12,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 184 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-05 00:53:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-05 00:53:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-05 00:53:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:53:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2022-04-05 00:53:12,149 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 85 [2022-04-05 00:53:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:53:12,149 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2022-04-05 00:53:12,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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-04-05 00:53:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-04-05 00:53:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-05 00:53:12,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:53:12,151 INFO L499 BasicCegarLoop]: trace histogram [70, 58, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:53:12,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-05 00:53:12,358 WARN L460 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-04-05 00:53:12,359 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:53:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:53:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1736138738, now seen corresponding path program 6 times [2022-04-05 00:53:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:53:12,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595739200] [2022-04-05 00:53:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:53:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:53:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:53:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:53:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:53:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1357 proven. 3422 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-05 00:53:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:53:14,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595739200] [2022-04-05 00:53:14,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595739200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:53:14,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361553230] [2022-04-05 00:53:14,220 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-05 00:53:14,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:53:14,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:53:14,225 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-04-05 00:53:14,226 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-04-05 00:53:36,851 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-04-05 00:53:36,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:53:36,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-05 00:53:36,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:53:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2022 proven. 984 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2022-04-05 00:53:39,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:53:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1450 proven. 144 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2022-04-05 00:53:42,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361553230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:53:42,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:53:42,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 28, 19] total 105 [2022-04-05 00:53:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463222517] [2022-04-05 00:53:42,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:53:42,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-04-05 00:53:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:53:42,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-04-05 00:53:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2717, Invalid=8203, Unknown=0, NotChecked=0, Total=10920 [2022-04-05 00:53:42,577 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 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-04-05 00:56:40,123 WARN L232 SmtUtils]: Spent 38.78s on a formula simplification. DAG size of input: 93 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:56:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:56:41,791 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2022-04-05 00:56:41,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-04-05 00:56:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 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 151 [2022-04-05 00:56:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:56:41,793 INFO L225 Difference]: With dead ends: 215 [2022-04-05 00:56:41,793 INFO L226 Difference]: Without dead ends: 212 [2022-04-05 00:56:41,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6614 ImplicationChecksByTransitivity, 181.1s TimeCoverageRelationStatistics Valid=8271, Invalid=35201, Unknown=0, NotChecked=0, Total=43472 [2022-04-05 00:56:41,798 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 252 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6174 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 7252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 6174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:56:41,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 111 Invalid, 7252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 6174 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-05 00:56:41,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-05 00:56:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 182. [2022-04-05 00:56:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:56:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-04-05 00:56:41,805 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 151 [2022-04-05 00:56:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:56:41,806 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-04-05 00:56:41,806 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 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-04-05 00:56:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-04-05 00:56:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-05 00:56:41,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:56:41,807 INFO L499 BasicCegarLoop]: trace histogram [85, 59, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:56:41,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 00:56:42,014 WARN L460 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-04-05 00:56:42,015 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:56:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:56:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 117892418, now seen corresponding path program 7 times [2022-04-05 00:56:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:56:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372441291] [2022-04-05 00:56:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:56:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:56:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:56:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:56:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:56:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3060 proven. 3540 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-05 00:56:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:56:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372441291] [2022-04-05 00:56:43,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372441291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:56:43,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703974691] [2022-04-05 00:56:43,950 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-05 00:56:43,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:56:43,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:56:43,963 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-04-05 00:56:43,992 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-04-05 00:56:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:56:44,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 130 conjunts are in the unsatisfiable core [2022-04-05 00:56:44,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:56:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 2752 proven. 4032 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-05 00:56:44,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:56:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 2752 proven. 4032 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-05 00:56:53,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703974691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:56:53,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:56:53,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 66, 67] total 133 [2022-04-05 00:56:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6083963] [2022-04-05 00:56:53,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:56:53,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2022-04-05 00:56:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:56:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2022-04-05 00:56:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4549, Invalid=13007, Unknown=0, NotChecked=0, Total=17556 [2022-04-05 00:56:53,645 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 133 states, 133 states have (on average 2.030075187969925) internal successors, (270), 132 states have internal predecessors, (270), 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-04-05 00:56:58,820 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse2 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 57 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 54) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ 13 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 (+ 35 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse44 100000000)) (< .cse44 10000000))) (let ((.cse45 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse46 100000000)) (< .cse46 10000000))) (let ((.cse47 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (not (< .cse47 100000000)))) (let ((.cse48 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (not (< .cse49 100000000)))) (let ((.cse50 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000)))) (let ((.cse54 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse55 100000000)) (< .cse55 10000000))) (let ((.cse56 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ c_main_~x~0 11) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse58 100000000)) (< .cse58 10000000))) (let ((.cse59 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse59 100000000)) (< .cse59 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse60 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse60 10000000) (not (< .cse60 100000000)))) (let ((.cse61 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse61 10000000) (not (< .cse61 100000000)))) (let ((.cse62 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse62 10000000) (not (< .cse62 100000000))))) is different from false [2022-04-05 00:57:00,851 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 57 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 54) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ 13 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 (+ 35 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse44 100000000)) (< .cse44 10000000))) (let ((.cse45 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse46 100000000)) (< .cse46 10000000))) (let ((.cse47 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (not (< .cse47 100000000)))) (let ((.cse48 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (not (< .cse49 100000000)))) (let ((.cse50 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000)))) (let ((.cse54 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse55 100000000)) (< .cse55 10000000))) (let ((.cse56 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ c_main_~x~0 11) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse58 100000000)) (< .cse58 10000000))) (let ((.cse59 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse59 100000000)) (< .cse59 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse60 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse60 10000000) (not (< .cse60 100000000)))) (let ((.cse61 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse61 10000000) (not (< .cse61 100000000)))) (let ((.cse62 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse62 10000000) (not (< .cse62 100000000))))) is different from false [2022-04-05 00:57:02,871 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 57 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 54) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 28 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 (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse50 10000000) (not (< .cse50 100000000)))) (let ((.cse51 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse52 10000000) (not (< .cse52 100000000)))) (let ((.cse53 (mod (+ c_main_~x~0 11) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000)))) (let ((.cse54 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse54 100000000)) (< .cse54 10000000))) (let ((.cse55 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse55 100000000)) (< .cse55 10000000))) (let ((.cse56 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000))))) is different from false