/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/mono-crafted_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:15:06,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:15:06,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:15:06,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:15:06,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:15:06,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:15:06,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:15:06,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:15:06,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:15:06,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:15:06,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:15:06,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:15:06,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:15:06,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:15:06,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:15:06,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:15:06,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:15:06,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:15:06,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:15:06,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:15:06,870 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:15:06,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:15:06,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:15:06,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:15:06,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:15:06,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:15:06,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:15:06,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:15:06,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:15:06,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:15:06,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:15:06,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:15:06,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:15:06,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:15:06,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:15:06,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:15:06,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:15:06,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:15:06,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:15:06,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:15:06,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:15:06,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:15:06,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:15:06,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:15:06,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:15:06,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:15:06,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:15:06,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:15:06,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:15:06,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:15:06,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:15:06,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:15:06,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:15:06,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:15:06,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:15:06,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:15:06,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:15:06,908 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:15:06,908 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-03-20 04:15:07,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:15:07,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:15:07,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:15:07,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:15:07,129 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:15:07,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-03-20 04:15:07,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21132252/ed15955e7bfd4c2eb60bc323fbe52593/FLAGada68a7b1 [2022-03-20 04:15:07,588 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:15:07,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-03-20 04:15:07,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21132252/ed15955e7bfd4c2eb60bc323fbe52593/FLAGada68a7b1 [2022-03-20 04:15:08,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21132252/ed15955e7bfd4c2eb60bc323fbe52593 [2022-03-20 04:15:08,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:15:08,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:15:08,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:15:08,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:15:08,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:15:08,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73173cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08, skipping insertion in model container [2022-03-20 04:15:08,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:15:08,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:15:08,226 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/mono-crafted_8.c[318,331] [2022-03-20 04:15:08,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:15:08,262 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:15:08,272 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/mono-crafted_8.c[318,331] [2022-03-20 04:15:08,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:15:08,285 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:15:08,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08 WrapperNode [2022-03-20 04:15:08,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:15:08,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:15:08,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:15:08,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:15:08,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:15:08,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:15:08,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:15:08,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:15:08,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:15:08,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:08,352 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-03-20 04:15:08,369 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-03-20 04:15:08,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:15:08,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:15:08,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:15:08,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:15:08,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:15:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:15:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:15:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:15:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:15:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:15:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:15:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:15:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:15:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:15:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:15:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:15:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:15:08,453 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:15:08,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:15:08,534 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:15:08,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:15:08,539 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 04:15:08,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:15:08 BoogieIcfgContainer [2022-03-20 04:15:08,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:15:08,542 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:15:08,542 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:15:08,543 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:15:08,545 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:15:08" (1/1) ... [2022-03-20 04:15:08,553 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:15:08,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:15:08 BasicIcfg [2022-03-20 04:15:08,564 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:15:08,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:15:08,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:15:08,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:15:08,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:15:08" (1/4) ... [2022-03-20 04:15:08,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed9e00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:15:08, skipping insertion in model container [2022-03-20 04:15:08,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:15:08" (2/4) ... [2022-03-20 04:15:08,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed9e00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:15:08, skipping insertion in model container [2022-03-20 04:15:08,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:15:08" (3/4) ... [2022-03-20 04:15:08,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed9e00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:15:08, skipping insertion in model container [2022-03-20 04:15:08,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:15:08" (4/4) ... [2022-03-20 04:15:08,592 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.cJordan [2022-03-20 04:15:08,596 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:15:08,596 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:15:08,655 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:15:08,663 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-03-20 04:15:08,663 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:15:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-03-20 04:15:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 04:15:08,679 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:08,680 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:08,680 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-03-20 04:15:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:08,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484490844] [2022-03-20 04:15:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:08,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484490844] [2022-03-20 04:15:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484490844] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:15:08,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:15:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:15:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366086501] [2022-03-20 04:15:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:15:08,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:15:08,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:15:08,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:15:08,848 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-03-20 04:15:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:08,891 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-03-20 04:15:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:15:08,895 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-03-20 04:15:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:08,901 INFO L225 Difference]: With dead ends: 21 [2022-03-20 04:15:08,901 INFO L226 Difference]: Without dead ends: 14 [2022-03-20 04:15:08,902 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-03-20 04:15:08,906 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-03-20 04:15:08,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:15:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-03-20 04:15:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-03-20 04:15:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-03-20 04:15:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-03-20 04:15:08,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-03-20 04:15:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:08,933 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-03-20 04:15:08,934 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-03-20 04:15:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-03-20 04:15:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 04:15:08,935 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:08,935 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:08,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:15:08,935 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-03-20 04:15:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:08,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629202856] [2022-03-20 04:15:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:09,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629202856] [2022-03-20 04:15:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629202856] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:15:09,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:15:09,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 04:15:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218505184] [2022-03-20 04:15:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:15:09,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 04:15:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 04:15:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 04:15:09,059 INFO L87 Difference]: Start difference. First operand 14 states and 15 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-03-20 04:15:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:09,105 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-03-20 04:15:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 04:15:09,106 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-03-20 04:15:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:09,107 INFO L225 Difference]: With dead ends: 17 [2022-03-20 04:15:09,107 INFO L226 Difference]: Without dead ends: 17 [2022-03-20 04:15:09,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-20 04:15:09,109 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:09,109 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:15:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-20 04:15:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-03-20 04:15:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-03-20 04:15:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-03-20 04:15:09,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-03-20 04:15:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:09,113 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-03-20 04:15:09,114 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-03-20 04:15:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-03-20 04:15:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-20 04:15:09,114 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:09,114 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:09,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:15:09,115 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-03-20 04:15:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:09,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032839424] [2022-03-20 04:15:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:09,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032839424] [2022-03-20 04:15:09,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032839424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:09,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359085507] [2022-03-20 04:15:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:09,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:09,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:09,235 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-03-20 04:15:09,271 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-03-20 04:15:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:15:09,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:09,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:09,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359085507] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:15:09,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:15:09,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-03-20 04:15:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960667421] [2022-03-20 04:15:09,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:15:09,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 04:15:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:09,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 04:15:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-20 04:15:09,496 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-03-20 04:15:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:09,625 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-03-20 04:15:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:15:09,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 14 [2022-03-20 04:15:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:09,626 INFO L225 Difference]: With dead ends: 24 [2022-03-20 04:15:09,626 INFO L226 Difference]: Without dead ends: 24 [2022-03-20 04:15:09,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:15:09,630 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:09,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 28 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:15:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-20 04:15:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-03-20 04:15:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-03-20 04:15:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-03-20 04:15:09,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-03-20 04:15:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:09,641 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-03-20 04:15:09,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-03-20 04:15:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-03-20 04:15:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 04:15:09,642 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:09,643 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:09,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 04:15:09,859 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-03-20 04:15:09,860 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1579293370, now seen corresponding path program 1 times [2022-03-20 04:15:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:09,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438930188] [2022-03-20 04:15:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:15:09,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438930188] [2022-03-20 04:15:09,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438930188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523302261] [2022-03-20 04:15:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:09,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:09,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:10,002 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-03-20 04:15:10,004 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-03-20 04:15:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:10,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 04:15:10,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:15:10,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:15:10,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523302261] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:15:10,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:15:10,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-20 04:15:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053529389] [2022-03-20 04:15:10,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:15:10,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 04:15:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:10,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 04:15:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-20 04:15:10,386 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-03-20 04:15:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:10,581 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-03-20 04:15:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:15:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 23 [2022-03-20 04:15:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:10,583 INFO L225 Difference]: With dead ends: 34 [2022-03-20 04:15:10,583 INFO L226 Difference]: Without dead ends: 34 [2022-03-20 04:15:10,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-03-20 04:15:10,585 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:10,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 33 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:15:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-20 04:15:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-03-20 04:15:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-03-20 04:15:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-03-20 04:15:10,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-03-20 04:15:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:10,590 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-03-20 04:15:10,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-03-20 04:15:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-03-20 04:15:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 04:15:10,591 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:10,591 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:10,619 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-03-20 04:15:10,803 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-03-20 04:15:10,804 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-03-20 04:15:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:10,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853311577] [2022-03-20 04:15:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:10,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853311577] [2022-03-20 04:15:10,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853311577] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:10,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437503541] [2022-03-20 04:15:10,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:15:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:10,977 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-03-20 04:15:11,007 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-03-20 04:15:11,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:15:11,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:15:11,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:15:11,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:11,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:11,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437503541] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:15:11,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:15:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2022-03-20 04:15:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800655172] [2022-03-20 04:15:11,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:15:11,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:15:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:11,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:15:11,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-03-20 04:15:11,353 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 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-03-20 04:15:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:11,842 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-03-20 04:15:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 04:15:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 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 23 [2022-03-20 04:15:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:11,844 INFO L225 Difference]: With dead ends: 42 [2022-03-20 04:15:11,844 INFO L226 Difference]: Without dead ends: 42 [2022-03-20 04:15:11,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2022-03-20 04:15:11,845 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:11,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 38 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:15:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-20 04:15:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-20 04:15:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-03-20 04:15:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-03-20 04:15:11,850 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-03-20 04:15:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:11,850 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-03-20 04:15:11,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 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-03-20 04:15:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-03-20 04:15:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 04:15:11,851 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:11,851 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:11,877 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-03-20 04:15:12,075 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-03-20 04:15:12,075 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash -443899610, now seen corresponding path program 2 times [2022-03-20 04:15:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:12,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400986843] [2022-03-20 04:15:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 04:15:12,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:12,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400986843] [2022-03-20 04:15:12,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400986843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:12,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126563355] [2022-03-20 04:15:12,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:15:12,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:12,234 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-03-20 04:15:12,235 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-03-20 04:15:12,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:15:12,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:15:12,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 04:15:12,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 04:15:12,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 04:15:12,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126563355] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:15:12,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:15:12,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-20 04:15:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200020664] [2022-03-20 04:15:12,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:15:12,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:15:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:15:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-03-20 04:15:12,614 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 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-03-20 04:15:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:14,298 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-03-20 04:15:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 04:15:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 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 41 [2022-03-20 04:15:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:14,299 INFO L225 Difference]: With dead ends: 60 [2022-03-20 04:15:14,299 INFO L226 Difference]: Without dead ends: 60 [2022-03-20 04:15:14,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2022-03-20 04:15:14,301 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:14,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 48 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 04:15:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-20 04:15:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-03-20 04:15:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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-03-20 04:15:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-03-20 04:15:14,306 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 41 [2022-03-20 04:15:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:14,306 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-03-20 04:15:14,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 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-03-20 04:15:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-03-20 04:15:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 04:15:14,307 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:14,307 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:14,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 04:15:14,519 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-03-20 04:15:14,519 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash -556846618, now seen corresponding path program 3 times [2022-03-20 04:15:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:14,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514611320] [2022-03-20 04:15:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514611320] [2022-03-20 04:15:14,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514611320] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7396117] [2022-03-20 04:15:14,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 04:15:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:14,824 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-03-20 04:15:14,826 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-03-20 04:15:14,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-20 04:15:14,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:15:14,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 04:15:14,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-03-20 04:15:15,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:15:15,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7396117] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:15:15,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:15:15,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-03-20 04:15:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148665978] [2022-03-20 04:15:15,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:15:15,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 04:15:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 04:15:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-03-20 04:15:15,011 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:15,049 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-03-20 04:15:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 04:15:15,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 41 [2022-03-20 04:15:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:15,051 INFO L225 Difference]: With dead ends: 60 [2022-03-20 04:15:15,051 INFO L226 Difference]: Without dead ends: 60 [2022-03-20 04:15:15,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-03-20 04:15:15,052 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:15,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:15:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-20 04:15:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-03-20 04:15:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-03-20 04:15:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-03-20 04:15:15,057 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 41 [2022-03-20 04:15:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:15,057 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-03-20 04:15:15,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-03-20 04:15:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-20 04:15:15,058 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:15,058 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:15,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 04:15:15,277 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-03-20 04:15:15,277 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash -236436009, now seen corresponding path program 3 times [2022-03-20 04:15:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:15,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043654312] [2022-03-20 04:15:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:15,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043654312] [2022-03-20 04:15:15,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043654312] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:15,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141245799] [2022-03-20 04:15:15,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 04:15:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:15,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:15,553 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-03-20 04:15:15,555 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-03-20 04:15:15,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 04:15:15,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:15:15,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 04:15:15,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-03-20 04:15:15,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-03-20 04:15:16,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141245799] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:15:16,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:15:16,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 26 [2022-03-20 04:15:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438822347] [2022-03-20 04:15:16,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:15:16,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 04:15:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 04:15:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-03-20 04:15:16,076 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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-03-20 04:15:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:17,331 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-03-20 04:15:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-20 04:15:17,331 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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 56 [2022-03-20 04:15:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:17,332 INFO L225 Difference]: With dead ends: 79 [2022-03-20 04:15:17,332 INFO L226 Difference]: Without dead ends: 79 [2022-03-20 04:15:17,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=547, Invalid=2003, Unknown=0, NotChecked=0, Total=2550 [2022-03-20 04:15:17,334 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 182 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:17,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 62 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 04:15:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-03-20 04:15:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-03-20 04:15:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 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-03-20 04:15:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-03-20 04:15:17,339 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 56 [2022-03-20 04:15:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:17,339 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-03-20 04:15:17,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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-03-20 04:15:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-03-20 04:15:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-20 04:15:17,340 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:17,340 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:17,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-20 04:15:17,563 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-03-20 04:15:17,563 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1430063529, now seen corresponding path program 4 times [2022-03-20 04:15:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:17,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470440387] [2022-03-20 04:15:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 233 proven. 392 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 04:15:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:17,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470440387] [2022-03-20 04:15:17,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470440387] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:17,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539863084] [2022-03-20 04:15:17,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 04:15:17,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:17,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:17,888 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-03-20 04:15:17,888 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-03-20 04:15:17,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 04:15:17,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:15:17,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-20 04:15:17,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:18,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:15:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539863084] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:15:19,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:15:19,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 24] total 47 [2022-03-20 04:15:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979480351] [2022-03-20 04:15:19,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:15:19,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-20 04:15:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-20 04:15:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1569, Unknown=0, NotChecked=0, Total=2162 [2022-03-20 04:15:19,536 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 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-03-20 04:16:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:16:29,410 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2022-03-20 04:16:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-20 04:16:29,410 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 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 74 [2022-03-20 04:16:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:16:29,412 INFO L225 Difference]: With dead ends: 153 [2022-03-20 04:16:29,412 INFO L226 Difference]: Without dead ends: 153 [2022-03-20 04:16:29,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 70.2s TimeCoverageRelationStatistics Valid=2121, Invalid=5710, Unknown=1, NotChecked=0, Total=7832 [2022-03-20 04:16:29,414 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 303 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 04:16:29,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 119 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 04:16:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-03-20 04:16:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-03-20 04:16:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 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-03-20 04:16:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2022-03-20 04:16:29,422 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 74 [2022-03-20 04:16:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:16:29,422 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2022-03-20 04:16:29,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 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-03-20 04:16:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-03-20 04:16:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-20 04:16:29,424 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:16:29,424 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 42, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:16:29,442 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-03-20 04:16:29,631 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-03-20 04:16:29,632 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:16:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:16:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1642783383, now seen corresponding path program 5 times [2022-03-20 04:16:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:16:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049558055] [2022-03-20 04:16:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:16:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:16:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:16:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:16:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:16:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 597 proven. 2667 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 04:16:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:16:30,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049558055] [2022-03-20 04:16:30,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049558055] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:16:30,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583108813] [2022-03-20 04:16:30,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 04:16:30,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:16:30,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:16:30,820 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-03-20 04:16:30,823 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-03-20 04:20:19,590 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2022-03-20 04:20:19,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:20:19,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-20 04:20:19,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:20:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 93 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:20:22,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:20:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 93 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:20:26,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583108813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:20:26,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:20:26,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50, 50] total 142 [2022-03-20 04:20:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883748304] [2022-03-20 04:20:26,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:20:26,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-03-20 04:20:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:20:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-03-20 04:20:26,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4778, Invalid=15244, Unknown=0, NotChecked=0, Total=20022 [2022-03-20 04:20:26,942 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 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-03-20 04:20:33,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ 3 c_main_~x~0) 4294967296))) (or (not (< .cse3 .cse1)) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (not (< .cse5 .cse1)))) (let ((.cse6 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse6)) (not (< .cse6 .cse1)))) (let ((.cse7 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse7 .cse1)) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse8 .cse1)) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse9)) (not (< .cse9 .cse1)))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (not (< .cse10 .cse1)))) (let ((.cse11 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse13 .cse1)) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse14 .cse1)) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (not (< .cse15 .cse1)))) (let ((.cse16 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (not (< .cse16 .cse1)))) (let ((.cse17 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse18 .cse1)) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse19 .cse1)) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (not (< .cse20 .cse1)))) (let ((.cse21 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (not (< .cse21 .cse1)))) (let ((.cse22 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse23 .cse1)) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (not (< .cse25 .cse1)))) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse27 .cse1)) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse28 .cse1)) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse32 .cse1)) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (not (< .cse34 .cse1)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (not (< .cse35 .cse1)))) (let ((.cse36 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (not (< .cse36 .cse1)))) (let ((.cse37 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse39 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse40 .cse1)) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse43 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (not (< .cse43 .cse1)))) (let ((.cse44 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (not (< .cse44 .cse1)))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse45 .cse1)) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (not (< .cse46 .cse1)))))) is different from false [2022-03-20 04:20:35,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (let ((.cse3 (mod (+ 3 c_main_~x~0) 4294967296))) (or (not (< .cse3 .cse1)) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (not (< .cse5 .cse1)))) (let ((.cse6 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse6)) (not (< .cse6 .cse1)))) (let ((.cse7 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse7 .cse1)) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse8 .cse1)) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse9)) (not (< .cse9 .cse1)))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (not (< .cse10 .cse1)))) (let ((.cse11 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse13 .cse1)) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse14 .cse1)) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (not (< .cse15 .cse1)))) (let ((.cse16 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (not (< .cse16 .cse1)))) (let ((.cse17 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse18 .cse1)) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse19 .cse1)) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (not (< .cse20 .cse1)))) (let ((.cse21 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (not (< .cse21 .cse1)))) (let ((.cse22 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse23 .cse1)) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (not (< .cse25 .cse1)))) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse27 .cse1)) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse28 .cse1)) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse32 .cse1)) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (not (< .cse34 .cse1)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (not (< .cse35 .cse1)))) (let ((.cse36 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (not (< .cse36 .cse1)))) (let ((.cse37 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse39 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse40 .cse1)) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (not (< .cse43 .cse1)))) (let ((.cse44 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (not (< .cse44 .cse1)))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse45 .cse1)) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (not (< .cse46 .cse1)))))) is different from false [2022-03-20 04:29:30,841 WARN L232 SmtUtils]: Spent 7.85m on a formula simplification that was a NOOP. DAG size: 342 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:29:32,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:29:34,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:29:36,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:29:38,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:29:40,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:29:42,812 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse2 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (let ((.cse3 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse3)) (not (< .cse3 .cse1)))) (let ((.cse4 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse5 .cse1)) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse6 .cse1)) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse7)) (not (< .cse7 .cse1)))) (let ((.cse8 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (not (< .cse8 .cse1)))) (let ((.cse9 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse9 .cse1)) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse10 .cse1)) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse13)) (not (< .cse13 .cse1)))) (let ((.cse14 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (not (< .cse14 .cse1)))) (let ((.cse15 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse15 .cse1)) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse16 .cse1)) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse18)) (not (< .cse18 .cse1)))) (let ((.cse19 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse19)) (not (< .cse19 .cse1)))) (let ((.cse20 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse20 .cse1)) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse21 .cse1)) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (not (< .cse23 .cse1)))) (let ((.cse24 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse25 .cse1)) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse27)) (not (< .cse27 .cse1)))) (let ((.cse28 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (not (< .cse28 .cse1)))) (let ((.cse29 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse30 .cse1)) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse32)) (not (< .cse32 .cse1)))) (let ((.cse33 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse34 .cse1)) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse35 .cse1)) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse36 .cse1)) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse40 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse40)) (not (< .cse40 .cse1)))) (let ((.cse41 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (not (< .cse41 .cse1)))) (let ((.cse42 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))))) is different from false