/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/array-examples/sanfoundry_10_ground.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 07:23:39,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 07:23:39,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 07:23:39,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 07:23:39,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 07:23:39,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 07:23:39,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 07:23:39,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 07:23:39,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 07:23:39,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 07:23:39,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 07:23:39,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 07:23:39,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 07:23:39,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 07:23:39,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 07:23:39,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 07:23:39,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 07:23:39,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 07:23:39,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 07:23:39,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 07:23:39,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 07:23:39,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 07:23:39,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 07:23:39,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 07:23:39,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 07:23:39,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 07:23:39,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 07:23:39,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 07:23:39,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 07:23:39,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 07:23:39,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 07:23:39,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 07:23:39,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 07:23:39,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 07:23:39,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 07:23:39,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 07:23:39,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 07:23:39,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 07:23:39,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 07:23:39,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 07:23:39,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 07:23:39,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 07:23:39,500 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 07:23:39,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 07:23:39,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 07:23:39,502 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 07:23:39,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 07:23:39,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 07:23:39,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 07:23:39,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 07:23:39,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 07:23:39,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 07:23:39,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 07:23:39,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 07:23:39,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 07:23:39,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 07:23:39,505 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 07:23:39,505 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 07:23:39,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 07:23:39,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 07:23:39,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 07:23:39,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 07:23:39,728 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 07:23:39,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2022-01-31 07:23:39,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/402a7d02c/f7a7f27e18c647c5a2a9084535ffc6d3/FLAG73053ed1c [2022-01-31 07:23:40,160 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 07:23:40,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2022-01-31 07:23:40,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/402a7d02c/f7a7f27e18c647c5a2a9084535ffc6d3/FLAG73053ed1c [2022-01-31 07:23:40,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/402a7d02c/f7a7f27e18c647c5a2a9084535ffc6d3 [2022-01-31 07:23:40,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 07:23:40,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 07:23:40,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 07:23:40,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 07:23:40,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 07:23:40,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d551861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40, skipping insertion in model container [2022-01-31 07:23:40,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 07:23:40,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 07:23:40,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c[324,337] [2022-01-31 07:23:40,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 07:23:40,776 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 07:23:40,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c[324,337] [2022-01-31 07:23:40,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 07:23:40,811 INFO L208 MainTranslator]: Completed translation [2022-01-31 07:23:40,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40 WrapperNode [2022-01-31 07:23:40,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 07:23:40,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 07:23:40,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 07:23:40,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 07:23:40,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 07:23:40,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 07:23:40,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 07:23:40,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 07:23:40,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (1/1) ... [2022-01-31 07:23:40,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 07:23:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:40,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 07:23:40,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 07:23:40,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 07:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 07:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 07:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 07:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 07:23:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 07:23:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 07:23:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 07:23:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 07:23:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 07:23:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 07:23:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 07:23:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 07:23:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 07:23:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 07:23:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 07:23:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 07:23:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 07:23:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 07:23:40,951 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 07:23:40,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 07:23:41,104 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 07:23:41,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 07:23:41,108 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 07:23:41,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 07:23:41 BoogieIcfgContainer [2022-01-31 07:23:41,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 07:23:41,109 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 07:23:41,109 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 07:23:41,114 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 07:23:41,129 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 07:23:41" (1/1) ... [2022-01-31 07:23:41,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 07:23:41 BasicIcfg [2022-01-31 07:23:41,141 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 07:23:41,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 07:23:41,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 07:23:41,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 07:23:41,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 07:23:40" (1/4) ... [2022-01-31 07:23:41,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e59a427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 07:23:41, skipping insertion in model container [2022-01-31 07:23:41,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 07:23:40" (2/4) ... [2022-01-31 07:23:41,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e59a427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 07:23:41, skipping insertion in model container [2022-01-31 07:23:41,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 07:23:41" (3/4) ... [2022-01-31 07:23:41,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e59a427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 07:23:41, skipping insertion in model container [2022-01-31 07:23:41,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 07:23:41" (4/4) ... [2022-01-31 07:23:41,146 INFO L111 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_ground.cJordan [2022-01-31 07:23:41,149 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 07:23:41,149 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 07:23:41,191 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 07:23:41,199 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 07:23:41,199 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 07:23:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-01-31 07:23:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 07:23:41,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:41,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:41,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 33469082, now seen corresponding path program 1 times [2022-01-31 07:23:41,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:41,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655744996] [2022-01-31 07:23:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:41,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 07:23:41,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:41,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655744996] [2022-01-31 07:23:41,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655744996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 07:23:41,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 07:23:41,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 07:23:41,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167530022] [2022-01-31 07:23:41,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 07:23:41,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 07:23:41,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 07:23:41,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 07:23:41,419 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:41,458 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-01-31 07:23:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 07:23:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-01-31 07:23:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:41,466 INFO L225 Difference]: With dead ends: 31 [2022-01-31 07:23:41,467 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 07:23:41,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 07:23:41,470 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 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-01-31 07:23:41,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 07:23:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 07:23:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 07:23:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-31 07:23:41,497 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2022-01-31 07:23:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:41,497 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-31 07:23:41,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-31 07:23:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 07:23:41,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:41,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:41,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 07:23:41,500 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1579765912, now seen corresponding path program 1 times [2022-01-31 07:23:41,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:41,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172169295] [2022-01-31 07:23:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:41,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 07:23:41,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:41,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172169295] [2022-01-31 07:23:41,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172169295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 07:23:41,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 07:23:41,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 07:23:41,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000828479] [2022-01-31 07:23:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 07:23:41,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 07:23:41,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 07:23:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 07:23:41,600 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:41,681 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-01-31 07:23:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 07:23:41,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-01-31 07:23:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:41,682 INFO L225 Difference]: With dead ends: 28 [2022-01-31 07:23:41,682 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 07:23:41,682 INFO L932 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-01-31 07:23:41,683 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:41,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 35 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 07:23:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 07:23:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-01-31 07:23:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-31 07:23:41,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-01-31 07:23:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:41,689 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-31 07:23:41,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-31 07:23:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 07:23:41,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:41,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:41,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 07:23:41,690 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1493223046, now seen corresponding path program 1 times [2022-01-31 07:23:41,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:41,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907686343] [2022-01-31 07:23:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:41,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 07:23:41,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:41,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907686343] [2022-01-31 07:23:41,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907686343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 07:23:41,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 07:23:41,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 07:23:41,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246946754] [2022-01-31 07:23:41,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 07:23:41,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 07:23:41,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 07:23:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 07:23:41,776 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:41,873 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-01-31 07:23:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 07:23:41,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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 18 [2022-01-31 07:23:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:41,875 INFO L225 Difference]: With dead ends: 36 [2022-01-31 07:23:41,875 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 07:23:41,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 07:23:41,877 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:41,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 07:23:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 07:23:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-01-31 07:23:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-01-31 07:23:41,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2022-01-31 07:23:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:41,881 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-01-31 07:23:41,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-01-31 07:23:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 07:23:41,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:41,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:41,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 07:23:41,882 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1116117497, now seen corresponding path program 1 times [2022-01-31 07:23:41,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:41,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742500935] [2022-01-31 07:23:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:41,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 07:23:41,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742500935] [2022-01-31 07:23:41,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742500935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 07:23:41,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 07:23:41,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 07:23:41,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920916158] [2022-01-31 07:23:41,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 07:23:41,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 07:23:41,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 07:23:41,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 07:23:41,965 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:42,002 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-01-31 07:23:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 07:23:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 21 [2022-01-31 07:23:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:42,003 INFO L225 Difference]: With dead ends: 29 [2022-01-31 07:23:42,003 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 07:23:42,003 INFO L932 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-01-31 07:23:42,009 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:42,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 33 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 07:23:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 07:23:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 07:23:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-31 07:23:42,013 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2022-01-31 07:23:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:42,013 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-31 07:23:42,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:23:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-31 07:23:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 07:23:42,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:42,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:42,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 07:23:42,014 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 843340468, now seen corresponding path program 1 times [2022-01-31 07:23:42,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123222720] [2022-01-31 07:23:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:42,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:42,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 07:23:42,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:42,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123222720] [2022-01-31 07:23:42,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123222720] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:23:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867307633] [2022-01-31 07:23:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:42,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:42,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:23:42,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 07:23:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:42,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 07:23:42,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:23:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 07:23:42,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:23:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 07:23:42,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867307633] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:23:42,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:23:42,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-01-31 07:23:42,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881621451] [2022-01-31 07:23:42,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:23:42,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 07:23:42,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 07:23:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-01-31 07:23:42,342 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-01-31 07:23:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:42,625 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-01-31 07:23:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 07:23:42,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 22 [2022-01-31 07:23:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:42,627 INFO L225 Difference]: With dead ends: 72 [2022-01-31 07:23:42,628 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 07:23:42,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2022-01-31 07:23:42,628 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 102 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:42,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 54 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 07:23:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 07:23:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 45. [2022-01-31 07:23:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-01-31 07:23:42,651 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2022-01-31 07:23:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:42,651 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-01-31 07:23:42,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-01-31 07:23:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-01-31 07:23:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 07:23:42,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:42,653 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:42,672 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-01-31 07:23:42,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:42,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash -391622932, now seen corresponding path program 1 times [2022-01-31 07:23:42,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:42,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241411818] [2022-01-31 07:23:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:42,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:42,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:42,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241411818] [2022-01-31 07:23:42,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241411818] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:23:42,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548791636] [2022-01-31 07:23:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:42,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:42,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:42,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:23:42,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 07:23:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:43,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 07:23:43,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:23:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:43,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:23:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:43,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548791636] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:23:43,234 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:23:43,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-01-31 07:23:43,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513722724] [2022-01-31 07:23:43,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:23:43,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 07:23:43,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 07:23:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2022-01-31 07:23:43,236 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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-01-31 07:23:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:43,438 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-31 07:23:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 07:23:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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 31 [2022-01-31 07:23:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:43,439 INFO L225 Difference]: With dead ends: 63 [2022-01-31 07:23:43,439 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 07:23:43,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=479, Unknown=0, NotChecked=0, Total=756 [2022-01-31 07:23:43,440 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:43,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 46 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 07:23:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 07:23:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-01-31 07:23:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-01-31 07:23:43,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2022-01-31 07:23:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:43,444 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-01-31 07:23:43,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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-01-31 07:23:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-01-31 07:23:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 07:23:43,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:43,445 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:43,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 07:23:43,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-31 07:23:43,659 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1184227232, now seen corresponding path program 2 times [2022-01-31 07:23:43,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:43,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614318998] [2022-01-31 07:23:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:43,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:43,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:43,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614318998] [2022-01-31 07:23:43,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614318998] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:23:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422674603] [2022-01-31 07:23:43,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 07:23:43,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:43,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:23:43,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 07:23:43,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 07:23:43,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 07:23:43,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 07:23:43,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:23:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:44,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:23:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:44,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422674603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:23:44,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:23:44,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-01-31 07:23:44,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771187963] [2022-01-31 07:23:44,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:23:44,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 07:23:44,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 07:23:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=708, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 07:23:44,435 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 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-01-31 07:23:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:44,862 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-01-31 07:23:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 07:23:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 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 43 [2022-01-31 07:23:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:44,865 INFO L225 Difference]: With dead ends: 87 [2022-01-31 07:23:44,865 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 07:23:44,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1168, Invalid=2138, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 07:23:44,867 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:44,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 56 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 07:23:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 07:23:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-01-31 07:23:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-01-31 07:23:44,874 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 43 [2022-01-31 07:23:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:44,874 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-01-31 07:23:44,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 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-01-31 07:23:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-01-31 07:23:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 07:23:44,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:44,876 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:44,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-31 07:23:45,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:45,079 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1426044680, now seen corresponding path program 3 times [2022-01-31 07:23:45,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:45,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158271832] [2022-01-31 07:23:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:45,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:45,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 07:23:45,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:45,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158271832] [2022-01-31 07:23:45,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158271832] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:23:45,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268770342] [2022-01-31 07:23:45,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 07:23:45,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:45,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:23:45,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 07:23:45,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 07:23:45,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 07:23:45,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 07:23:45,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:23:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-01-31 07:23:45,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:23:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-01-31 07:23:45,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268770342] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:23:45,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:23:45,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6, 6] total 34 [2022-01-31 07:23:45,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122303979] [2022-01-31 07:23:45,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:23:45,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 07:23:45,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 07:23:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 07:23:45,832 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 33 states have internal predecessors, (90), 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-01-31 07:23:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:48,077 INFO L93 Difference]: Finished difference Result 295 states and 327 transitions. [2022-01-31 07:23:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-31 07:23:48,077 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 33 states have internal predecessors, (90), 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 67 [2022-01-31 07:23:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:48,079 INFO L225 Difference]: With dead ends: 295 [2022-01-31 07:23:48,079 INFO L226 Difference]: Without dead ends: 295 [2022-01-31 07:23:48,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3132 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3739, Invalid=8251, Unknown=0, NotChecked=0, Total=11990 [2022-01-31 07:23:48,083 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 834 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:48,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 63 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 07:23:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-01-31 07:23:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 204. [2022-01-31 07:23:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.1464646464646464) internal successors, (227), 198 states have internal predecessors, (227), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2022-01-31 07:23:48,094 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 67 [2022-01-31 07:23:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:48,095 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2022-01-31 07:23:48,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 33 states have internal predecessors, (90), 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-01-31 07:23:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2022-01-31 07:23:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 07:23:48,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:48,096 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:48,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 07:23:48,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:48,310 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash 183440640, now seen corresponding path program 1 times [2022-01-31 07:23:48,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:48,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817201169] [2022-01-31 07:23:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:48,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:23:48,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:48,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817201169] [2022-01-31 07:23:48,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817201169] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:23:48,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309074182] [2022-01-31 07:23:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:48,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:48,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:23:48,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 07:23:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:48,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 07:23:48,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:23:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:23:49,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:23:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:23:50,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309074182] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:23:50,291 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:23:50,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 81 [2022-01-31 07:23:50,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272798120] [2022-01-31 07:23:50,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:23:50,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-01-31 07:23:50,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-01-31 07:23:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=3618, Unknown=0, NotChecked=0, Total=6480 [2022-01-31 07:23:50,296 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 81 states, 81 states have (on average 2.1481481481481484) internal successors, (174), 80 states have internal predecessors, (174), 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-01-31 07:23:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:23:51,634 INFO L93 Difference]: Finished difference Result 265 states and 295 transitions. [2022-01-31 07:23:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-31 07:23:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 2.1481481481481484) internal successors, (174), 80 states have internal predecessors, (174), 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 78 [2022-01-31 07:23:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:23:51,638 INFO L225 Difference]: With dead ends: 265 [2022-01-31 07:23:51,638 INFO L226 Difference]: Without dead ends: 265 [2022-01-31 07:23:51,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5275 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6073, Invalid=11483, Unknown=0, NotChecked=0, Total=17556 [2022-01-31 07:23:51,643 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 162 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 07:23:51,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 40 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 07:23:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-31 07:23:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2022-01-31 07:23:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 252 states have (on average 1.1150793650793651) internal successors, (281), 252 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:23:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 286 transitions. [2022-01-31 07:23:51,661 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 286 transitions. Word has length 78 [2022-01-31 07:23:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:23:51,661 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 286 transitions. [2022-01-31 07:23:51,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 2.1481481481481484) internal successors, (174), 80 states have internal predecessors, (174), 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-01-31 07:23:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 286 transitions. [2022-01-31 07:23:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 07:23:51,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:23:51,663 INFO L514 BasicCegarLoop]: trace histogram [52, 52, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:23:51,685 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-01-31 07:23:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:51,875 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:23:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:23:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1686418134, now seen corresponding path program 2 times [2022-01-31 07:23:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:23:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255358217] [2022-01-31 07:23:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:23:51,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:23:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:23:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:23:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:23:52,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:23:52,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255358217] [2022-01-31 07:23:52,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255358217] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:23:52,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450202414] [2022-01-31 07:23:52,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 07:23:52,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:23:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:23:52,975 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-01-31 07:23:52,975 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-01-31 07:23:53,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 07:23:53,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 07:23:53,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-31 07:23:53,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:23:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:23:54,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:23:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:23:57,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450202414] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:23:57,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:23:57,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 162 [2022-01-31 07:23:57,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833654269] [2022-01-31 07:23:57,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:23:57,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-01-31 07:23:57,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:23:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-01-31 07:23:57,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11556, Invalid=14526, Unknown=0, NotChecked=0, Total=26082 [2022-01-31 07:23:57,556 INFO L87 Difference]: Start difference. First operand 258 states and 286 transitions. Second operand has 162 states, 162 states have (on average 2.074074074074074) internal successors, (336), 161 states have internal predecessors, (336), 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-01-31 07:24:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:24:01,935 INFO L93 Difference]: Finished difference Result 373 states and 403 transitions. [2022-01-31 07:24:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-01-31 07:24:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 162 states, 162 states have (on average 2.074074074074074) internal successors, (336), 161 states have internal predecessors, (336), 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 132 [2022-01-31 07:24:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:24:01,938 INFO L225 Difference]: With dead ends: 373 [2022-01-31 07:24:01,938 INFO L226 Difference]: Without dead ends: 373 [2022-01-31 07:24:01,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22204 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=24541, Invalid=47015, Unknown=0, NotChecked=0, Total=71556 [2022-01-31 07:24:01,944 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 297 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 07:24:01,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 65 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 07:24:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-01-31 07:24:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2022-01-31 07:24:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 1.0805555555555555) internal successors, (389), 360 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 07:24:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 394 transitions. [2022-01-31 07:24:01,952 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 394 transitions. Word has length 132 [2022-01-31 07:24:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:24:01,953 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 394 transitions. [2022-01-31 07:24:01,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 162 states, 162 states have (on average 2.074074074074074) internal successors, (336), 161 states have internal predecessors, (336), 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-01-31 07:24:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 394 transitions. [2022-01-31 07:24:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-31 07:24:01,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:24:01,957 INFO L514 BasicCegarLoop]: trace histogram [106, 106, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:24:01,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-31 07:24:02,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:24:02,165 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:24:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:24:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1733351682, now seen corresponding path program 3 times [2022-01-31 07:24:02,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:24:02,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247707643] [2022-01-31 07:24:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:24:02,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:24:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:24:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:24:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:24:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11249 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 07:24:06,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:24:06,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247707643] [2022-01-31 07:24:06,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247707643] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:24:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927607707] [2022-01-31 07:24:06,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 07:24:06,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:24:06,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:24:06,198 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-01-31 07:24:06,199 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-01-31 07:24:06,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 07:24:06,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 07:24:06,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-31 07:24:06,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:24:07,367 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 07:24:07,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-01-31 07:24:07,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-31 07:24:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11249 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11243 trivial. 0 not checked. [2022-01-31 07:24:07,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:24:10,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (forall ((v_ArrVal_934 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* main_~i~0 4)) v_ArrVal_934) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (< (+ main_~i~0 2) c_main_~n~0))) is different from false [2022-01-31 07:24:11,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-01-31 07:24:11,846 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 07:24:11,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2022-01-31 07:24:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11243 trivial. 6 not checked. [2022-01-31 07:24:12,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927607707] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:24:12,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:24:12,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 13, 13] total 129 [2022-01-31 07:24:12,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741777228] [2022-01-31 07:24:12,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:24:12,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2022-01-31 07:24:12,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:24:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2022-01-31 07:24:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6291, Invalid=9963, Unknown=6, NotChecked=252, Total=16512 [2022-01-31 07:24:12,660 INFO L87 Difference]: Start difference. First operand 366 states and 394 transitions. Second operand has 129 states, 128 states have (on average 2.109375) internal successors, (270), 127 states have internal predecessors, (270), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:24:20,959 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= 100000 c_main_~n~0) (= |c_main_~#vectorx~0.offset| 0) (= c_main_~i~0 0) (forall ((main_~i~0 Int)) (or (forall ((v_ArrVal_934 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* main_~i~0 4)) v_ArrVal_934) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (< (+ main_~i~0 2) c_main_~n~0))) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 07:24:23,046 WARN L838 $PredicateComparison]: unable to prove that (and (<= 100000 c_main_~n~0) (= |c_main_~#vectorx~0.offset| 0) (forall ((main_~i~0 Int)) (or (forall ((v_ArrVal_934 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* main_~i~0 4)) v_ArrVal_934) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (< (+ main_~i~0 2) c_main_~n~0))) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|)))) is different from false [2022-01-31 07:24:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:24:23,516 INFO L93 Difference]: Finished difference Result 412 states and 448 transitions. [2022-01-31 07:24:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-01-31 07:24:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 128 states have (on average 2.109375) internal successors, (270), 127 states have internal predecessors, (270), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 240 [2022-01-31 07:24:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:24:23,519 INFO L225 Difference]: With dead ends: 412 [2022-01-31 07:24:23,519 INFO L226 Difference]: Without dead ends: 412 [2022-01-31 07:24:23,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9405 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=19620, Invalid=41146, Unknown=8, NotChecked=1476, Total=62250 [2022-01-31 07:24:23,526 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 331 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 07:24:23,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 88 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 589 Invalid, 0 Unknown, 108 Unchecked, 0.6s Time] [2022-01-31 07:24:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-01-31 07:24:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 390. [2022-01-31 07:24:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 382 states have (on average 1.0916230366492146) internal successors, (417), 383 states have internal predecessors, (417), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 07:24:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 424 transitions. [2022-01-31 07:24:23,533 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 424 transitions. Word has length 240 [2022-01-31 07:24:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:24:23,534 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 424 transitions. [2022-01-31 07:24:23,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 128 states have (on average 2.109375) internal successors, (270), 127 states have internal predecessors, (270), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:24:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 424 transitions. [2022-01-31 07:24:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-31 07:24:23,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:24:23,537 INFO L514 BasicCegarLoop]: trace histogram [107, 107, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:24:23,555 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-01-31 07:24:23,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:24:23,752 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:24:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:24:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -698167176, now seen corresponding path program 4 times [2022-01-31 07:24:23,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:24:23,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426527586] [2022-01-31 07:24:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:24:23,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:24:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:24:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:24:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:24:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11477 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-31 07:24:27,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:24:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426527586] [2022-01-31 07:24:27,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426527586] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:24:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053624603] [2022-01-31 07:24:27,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 07:24:27,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:24:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:24:27,754 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-01-31 07:24:27,755 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-01-31 07:24:27,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 07:24:27,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 07:24:27,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 07:24:27,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:24:28,611 INFO L353 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-01-31 07:24:28,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 26 [2022-01-31 07:24:28,718 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 07:24:28,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-01-31 07:24:28,775 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 07:24:28,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-01-31 07:24:28,837 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 07:24:28,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-01-31 07:24:28,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-31 07:24:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11477 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 11449 trivial. 0 not checked. [2022-01-31 07:24:29,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:24:31,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_380 Int)) (or (forall ((v_ArrVal_1389 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_380)))) is different from false [2022-01-31 07:25:18,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_381 Int)) (or (forall ((v_ArrVal_1387 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int)) (or (not (= c_main_~element~0 (select (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_381)))) is different from false [2022-01-31 07:26:36,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_382 Int)) (or (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= c_main_~element~0 (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_382)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_382 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_382)))) is different from false [2022-01-31 07:29:53,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2022-01-31 07:29:53,582 INFO L353 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2022-01-31 07:29:53,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 884 treesize of output 685 [2022-01-31 07:29:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11477 backedges. 2 proven. 18 refuted. 1 times theorem prover too weak. 11450 trivial. 6 not checked. [2022-01-31 07:29:54,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053624603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:29:54,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:29:54,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 18, 20] total 140 [2022-01-31 07:29:54,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745681470] [2022-01-31 07:29:54,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:29:54,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2022-01-31 07:29:54,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:29:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2022-01-31 07:29:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6138, Invalid=12123, Unknown=383, NotChecked=816, Total=19460 [2022-01-31 07:29:54,497 INFO L87 Difference]: Start difference. First operand 390 states and 424 transitions. Second operand has 140 states, 139 states have (on average 2.035971223021583) internal successors, (283), 138 states have internal predecessors, (283), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:30:02,264 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* c_main_~pos~0 4)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0)) (not (<= (+ c_main_~pos~0 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|))) (= c_main_~i~0 1) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 07:30:02,745 WARN L838 $PredicateComparison]: unable to prove that (and (= 1 (+ (- 1) c_main_~i~0)) (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* c_main_~pos~0 4)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0)) (not (<= (+ c_main_~pos~0 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|)))) is different from false [2022-01-31 07:30:05,067 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_382 Int)) (or (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= c_main_~element~0 (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_382)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_382 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_382)))) (forall ((v_main_~i~0_381 Int)) (or (forall ((v_ArrVal_1387 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int)) (or (not (= c_main_~element~0 (select (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_381))))) is different from false [2022-01-31 07:30:08,577 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_382 Int)) (or (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= c_main_~element~0 (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_382)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_382 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_382)))) (forall ((v_main_~i~0_381 Int)) (or (forall ((v_ArrVal_1387 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int)) (or (not (= c_main_~element~0 (select (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_381)))) (forall ((v_main_~i~0_380 Int)) (or (forall ((v_ArrVal_1389 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_380)))) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|)))) is different from false [2022-01-31 07:30:10,661 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= 1 (+ (- 1) c_main_~i~0)) (forall ((v_main_~i~0_382 Int)) (or (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= c_main_~element~0 (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_382)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_382 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_382)))) (forall ((v_main_~i~0_381 Int)) (or (forall ((v_ArrVal_1387 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int)) (or (not (= c_main_~element~0 (select (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_381)))) (forall ((v_main_~i~0_380 Int)) (or (forall ((v_ArrVal_1389 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_380)))) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 07:30:12,727 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_382 Int)) (or (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= c_main_~element~0 (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_382)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_382 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_382)))) (forall ((v_main_~i~0_381 Int)) (or (forall ((v_ArrVal_1387 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int)) (or (not (= c_main_~element~0 (select (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_381)))) (forall ((v_main_~i~0_380 Int)) (or (forall ((v_ArrVal_1389 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_380)))) (<= 3 c_main_~i~0) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|)))) is different from false [2022-01-31 07:30:14,911 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_382 Int)) (or (forall ((v_ArrVal_1387 Int) (v_ArrVal_1386 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int) (v_main_~i~0_381 Int)) (or (not (= c_main_~element~0 (select (store (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_382)) v_ArrVal_1386) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_382 1) v_main_~i~0_381)) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_382)))) (forall ((v_main_~i~0_381 Int)) (or (forall ((v_ArrVal_1387 Int) (v_main_~i~0_380 Int) (v_ArrVal_1389 Int)) (or (not (= c_main_~element~0 (select (store (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_381)) v_ArrVal_1387) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|))) (not (<= (+ v_main_~i~0_381 1) v_main_~i~0_380)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_381)))) (forall ((v_main_~i~0_380 Int)) (or (forall ((v_ArrVal_1389 Int)) (not (= (select (store (select |c_#memory_int| |c_main_~#vectorx~0.base|) (+ |c_main_~#vectorx~0.offset| (* 4 v_main_~i~0_380)) v_ArrVal_1389) |c_main_~#vectorx~0.offset|) c_main_~element~0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_380)))) (<= 4 c_main_~i~0) (not (= c_main_~element~0 (select (select |c_#memory_int| |c_main_~#vectorx~0.base|) |c_main_~#vectorx~0.offset|)))) is different from false [2022-01-31 07:33:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:33:39,146 INFO L93 Difference]: Finished difference Result 495 states and 540 transitions. [2022-01-31 07:33:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-01-31 07:33:39,146 INFO L78 Accepts]: Start accepts. Automaton has has 140 states, 139 states have (on average 2.035971223021583) internal successors, (283), 138 states have internal predecessors, (283), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 248 [2022-01-31 07:33:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:33:39,153 INFO L225 Difference]: With dead ends: 495 [2022-01-31 07:33:39,153 INFO L226 Difference]: Without dead ends: 495 [2022-01-31 07:33:39,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 466 SyntacticMatches, 4 SemanticMatches, 278 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 13276 ImplicationChecksByTransitivity, 552.3s TimeCoverageRelationStatistics Valid=18494, Invalid=53309, Unknown=867, NotChecked=5450, Total=78120 [2022-01-31 07:33:39,158 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 316 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 07:33:39,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 126 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 711 Invalid, 0 Unknown, 573 Unchecked, 0.5s Time] [2022-01-31 07:33:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-01-31 07:33:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 445. [2022-01-31 07:33:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 437 states have (on average 1.080091533180778) internal successors, (472), 438 states have internal predecessors, (472), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 07:33:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 479 transitions. [2022-01-31 07:33:39,169 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 479 transitions. Word has length 248 [2022-01-31 07:33:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:33:39,169 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 479 transitions. [2022-01-31 07:33:39,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 139 states have (on average 2.035971223021583) internal successors, (283), 138 states have internal predecessors, (283), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 07:33:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 479 transitions. [2022-01-31 07:33:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-01-31 07:33:39,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:33:39,172 INFO L514 BasicCegarLoop]: trace histogram [108, 108, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:33:39,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 07:33:39,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 07:33:39,390 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:33:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:33:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1929100356, now seen corresponding path program 1 times [2022-01-31 07:33:39,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:33:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698704727] [2022-01-31 07:33:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:33:39,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:33:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:33:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:33:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:33:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-01-31 07:33:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:33:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11681 backedges. 2 proven. 11664 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 07:33:43,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:33:43,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698704727] [2022-01-31 07:33:43,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698704727] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:33:43,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816844788] [2022-01-31 07:33:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:33:43,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:33:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:33:43,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:33:43,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 07:33:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:33:43,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 111 conjunts are in the unsatisfiable core [2022-01-31 07:33:43,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:33:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11681 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 07:33:49,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:34:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11681 backedges. 2 proven. 11664 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 07:34:00,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816844788] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:34:00,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:34:00,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 111, 111] total 330 [2022-01-31 07:34:00,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744116439] [2022-01-31 07:34:00,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:34:00,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 330 states [2022-01-31 07:34:00,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:34:00,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 330 interpolants. [2022-01-31 07:34:00,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48180, Invalid=60390, Unknown=0, NotChecked=0, Total=108570 [2022-01-31 07:34:00,719 INFO L87 Difference]: Start difference. First operand 445 states and 479 transitions. Second operand has 330 states, 330 states have (on average 2.0575757575757576) internal successors, (679), 329 states have internal predecessors, (679), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 07:34:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:34:18,367 INFO L93 Difference]: Finished difference Result 666 states and 700 transitions. [2022-01-31 07:34:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-01-31 07:34:18,368 INFO L78 Accepts]: Start accepts. Automaton has has 330 states, 330 states have (on average 2.0575757575757576) internal successors, (679), 329 states have internal predecessors, (679), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 252 [2022-01-31 07:34:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:34:18,370 INFO L225 Difference]: With dead ends: 666 [2022-01-31 07:34:18,370 INFO L226 Difference]: Without dead ends: 666 [2022-01-31 07:34:18,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94500 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=102353, Invalid=197403, Unknown=0, NotChecked=0, Total=299756 [2022-01-31 07:34:18,388 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 468 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 07:34:18,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 50 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 07:34:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-31 07:34:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 660. [2022-01-31 07:34:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 652 states have (on average 1.0521472392638036) internal successors, (686), 653 states have internal predecessors, (686), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 07:34:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 693 transitions. [2022-01-31 07:34:18,399 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 693 transitions. Word has length 252 [2022-01-31 07:34:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:34:18,399 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 693 transitions. [2022-01-31 07:34:18,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 330 states, 330 states have (on average 2.0575757575757576) internal successors, (679), 329 states have internal predecessors, (679), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 07:34:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 693 transitions. [2022-01-31 07:34:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2022-01-31 07:34:18,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:34:18,444 INFO L514 BasicCegarLoop]: trace histogram [218, 218, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:34:18,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 07:34:18,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 07:34:18,650 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:34:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:34:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1502213464, now seen corresponding path program 2 times [2022-01-31 07:34:18,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:34:18,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855942179] [2022-01-31 07:34:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:34:18,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:34:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:34:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 07:34:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:34:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-01-31 07:34:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 07:34:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 47541 backedges. 2 proven. 47524 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 07:34:34,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 07:34:34,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855942179] [2022-01-31 07:34:34,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855942179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 07:34:34,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26489196] [2022-01-31 07:34:34,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 07:34:34,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 07:34:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 07:34:34,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 07:34:34,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 07:34:34,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 07:34:34,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 07:34:34,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 2101 conjuncts, 221 conjunts are in the unsatisfiable core [2022-01-31 07:34:34,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 07:34:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 47541 backedges. 0 proven. 47524 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 07:34:52,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 07:35:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 47541 backedges. 2 proven. 47524 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 07:35:38,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26489196] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 07:35:38,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 07:35:38,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [222, 221, 221] total 660 [2022-01-31 07:35:38,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565297924] [2022-01-31 07:35:38,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 07:35:38,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 660 states [2022-01-31 07:35:38,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 07:35:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 660 interpolants. [2022-01-31 07:35:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193160, Invalid=241780, Unknown=0, NotChecked=0, Total=434940 [2022-01-31 07:35:38,967 INFO L87 Difference]: Start difference. First operand 660 states and 693 transitions. Second operand has 660 states, 660 states have (on average 2.028787878787879) internal successors, (1339), 659 states have internal predecessors, (1339), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 07:36:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 07:36:52,356 INFO L93 Difference]: Finished difference Result 1106 states and 1140 transitions. [2022-01-31 07:36:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 441 states. [2022-01-31 07:36:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 660 states, 660 states have (on average 2.028787878787879) internal successors, (1339), 659 states have internal predecessors, (1339), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 472 [2022-01-31 07:36:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 07:36:52,360 INFO L225 Difference]: With dead ends: 1106 [2022-01-31 07:36:52,360 INFO L226 Difference]: Without dead ends: 1106 [2022-01-31 07:36:52,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1606 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 1096 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382590 ImplicationChecksByTransitivity, 140.2s TimeCoverageRelationStatistics Valid=410408, Invalid=794098, Unknown=0, NotChecked=0, Total=1204506 [2022-01-31 07:36:52,437 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 908 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 07:36:52,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 70 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 07:36:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-01-31 07:36:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1100. [2022-01-31 07:36:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1092 states have (on average 1.031135531135531) internal successors, (1126), 1093 states have internal predecessors, (1126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 07:36:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1133 transitions. [2022-01-31 07:36:52,450 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1133 transitions. Word has length 472 [2022-01-31 07:36:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 07:36:52,450 INFO L470 AbstractCegarLoop]: Abstraction has 1100 states and 1133 transitions. [2022-01-31 07:36:52,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 660 states, 660 states have (on average 2.028787878787879) internal successors, (1339), 659 states have internal predecessors, (1339), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 07:36:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1133 transitions. [2022-01-31 07:36:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2022-01-31 07:36:52,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 07:36:52,456 INFO L514 BasicCegarLoop]: trace histogram [438, 438, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 07:36:52,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-31 07:36:52,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 07:36:52,676 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 07:36:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 07:36:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 200127120, now seen corresponding path program 3 times [2022-01-31 07:36:52,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 07:36:52,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899334178] [2022-01-31 07:36:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 07:36:52,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 07:36:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat