/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/nla-digbench-scaling/cohencu-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 01:42:10,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 01:42:10,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 01:42:10,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 01:42:10,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 01:42:10,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 01:42:10,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 01:42:10,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 01:42:10,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 01:42:10,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 01:42:10,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 01:42:10,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 01:42:10,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 01:42:10,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 01:42:10,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 01:42:10,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 01:42:10,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 01:42:10,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 01:42:10,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 01:42:10,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 01:42:10,075 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 01:42:10,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 01:42:10,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 01:42:10,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 01:42:10,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 01:42:10,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 01:42:10,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 01:42:10,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 01:42:10,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 01:42:10,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 01:42:10,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 01:42:10,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 01:42:10,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 01:42:10,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 01:42:10,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 01:42:10,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 01:42:10,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 01:42:10,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 01:42:10,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 01:42:10,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 01:42:10,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 01:42:10,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 01:42:10,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 01:42:10,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 01:42:10,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 01:42:10,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 01:42:10,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 01:42:10,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 01:42:10,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 01:42:10,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 01:42:10,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 01:42:10,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 01:42:10,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 01:42:10,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 01:42:10,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 01:42:10,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 01:42:10,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 01:42:10,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 01:42:10,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 01:42:10,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 01:42:10,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 01:42:10,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 01:42:10,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 01:42:10,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 01:42:10,108 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 01:42:10,108 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 01:42:10,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 01:42:10,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 01:42:10,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 01:42:10,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 01:42:10,363 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 01:42:10,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-05 01:42:10,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eccd2458/4bc9d01ed6ad462184161c31a2d4141a/FLAG6c69c668c [2022-04-05 01:42:10,813 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 01:42:10,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-05 01:42:10,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eccd2458/4bc9d01ed6ad462184161c31a2d4141a/FLAG6c69c668c [2022-04-05 01:42:10,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eccd2458/4bc9d01ed6ad462184161c31a2d4141a [2022-04-05 01:42:10,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 01:42:10,837 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 01:42:10,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 01:42:10,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 01:42:10,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 01:42:10,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:42:10" (1/1) ... [2022-04-05 01:42:10,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bb4929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:10, skipping insertion in model container [2022-04-05 01:42:10,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:42:10" (1/1) ... [2022-04-05 01:42:10,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 01:42:10,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 01:42:11,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c[588,601] [2022-04-05 01:42:11,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 01:42:11,089 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 01:42:11,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c[588,601] [2022-04-05 01:42:11,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 01:42:11,135 INFO L208 MainTranslator]: Completed translation [2022-04-05 01:42:11,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11 WrapperNode [2022-04-05 01:42:11,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 01:42:11,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 01:42:11,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 01:42:11,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 01:42:11,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 01:42:11,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 01:42:11,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 01:42:11,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 01:42:11,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 01:42:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:11,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 01:42:11,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 01:42:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 01:42:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 01:42:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 01:42:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 01:42:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 01:42:11,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 01:42:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 01:42:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 01:42:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 01:42:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 01:42:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-05 01:42:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 01:42:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 01:42:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 01:42:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 01:42:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 01:42:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 01:42:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 01:42:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 01:42:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 01:42:11,315 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 01:42:11,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 01:42:11,447 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 01:42:11,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 01:42:11,452 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 01:42:11,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:42:11 BoogieIcfgContainer [2022-04-05 01:42:11,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 01:42:11,454 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 01:42:11,454 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 01:42:11,455 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 01:42:11,457 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:42:11" (1/1) ... [2022-04-05 01:42:11,459 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 01:42:11,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 01:42:11 BasicIcfg [2022-04-05 01:42:11,474 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 01:42:11,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 01:42:11,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 01:42:11,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 01:42:11,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 01:42:10" (1/4) ... [2022-04-05 01:42:11,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5024ce1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:42:11, skipping insertion in model container [2022-04-05 01:42:11,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:42:11" (2/4) ... [2022-04-05 01:42:11,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5024ce1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:42:11, skipping insertion in model container [2022-04-05 01:42:11,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:42:11" (3/4) ... [2022-04-05 01:42:11,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5024ce1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 01:42:11, skipping insertion in model container [2022-04-05 01:42:11,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 01:42:11" (4/4) ... [2022-04-05 01:42:11,483 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.cJordan [2022-04-05 01:42:11,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 01:42:11,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 01:42:11,532 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 01:42:11,539 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 01:42:11,540 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 01:42:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-05 01:42:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 01:42:11,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:11,557 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:11,558 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-05 01:42:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:11,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552143299] [2022-04-05 01:42:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 01:42:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:42:11,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:11,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552143299] [2022-04-05 01:42:11,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552143299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:42:11,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:42:11,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 01:42:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613641874] [2022-04-05 01:42:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:42:11,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 01:42:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 01:42:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 01:42:11,818 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:42:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:11,927 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-05 01:42:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 01:42:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-05 01:42:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:11,936 INFO L225 Difference]: With dead ends: 32 [2022-04-05 01:42:11,936 INFO L226 Difference]: Without dead ends: 27 [2022-04-05 01:42:11,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 01:42:11,945 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:11,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-05 01:42:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-05 01:42:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-05 01:42:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-05 01:42:11,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-05 01:42:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:11,985 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-05 01:42:11,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:42:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-05 01:42:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 01:42:11,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:11,986 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:11,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 01:42:11,987 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-05 01:42:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:11,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891362427] [2022-04-05 01:42:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 01:42:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:42:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:12,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891362427] [2022-04-05 01:42:12,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891362427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:42:12,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:42:12,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 01:42:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97860622] [2022-04-05 01:42:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:42:12,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:42:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:42:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:42:12,106 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:42:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:12,216 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-05 01:42:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 01:42:12,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-05 01:42:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:12,217 INFO L225 Difference]: With dead ends: 28 [2022-04-05 01:42:12,217 INFO L226 Difference]: Without dead ends: 28 [2022-04-05 01:42:12,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:42:12,219 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:12,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-05 01:42:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-05 01:42:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-05 01:42:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-05 01:42:12,226 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-05 01:42:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:12,226 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-05 01:42:12,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:42:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-05 01:42:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 01:42:12,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:12,227 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:12,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 01:42:12,227 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-05 01:42:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:12,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736388637] [2022-04-05 01:42:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 01:42:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:42:12,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:12,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736388637] [2022-04-05 01:42:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736388637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:42:12,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:42:12,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 01:42:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738022250] [2022-04-05 01:42:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:42:12,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 01:42:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 01:42:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:42:12,348 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:42:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:12,504 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-05 01:42:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 01:42:12,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-05 01:42:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:12,505 INFO L225 Difference]: With dead ends: 32 [2022-04-05 01:42:12,506 INFO L226 Difference]: Without dead ends: 32 [2022-04-05 01:42:12,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:42:12,507 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:12,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-05 01:42:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-05 01:42:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-05 01:42:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-05 01:42:12,514 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-05 01:42:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:12,514 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-05 01:42:12,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:42:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-05 01:42:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 01:42:12,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:12,515 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:12,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 01:42:12,515 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-05 01:42:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:12,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032899600] [2022-04-05 01:42:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:12,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:12,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744033197] [2022-04-05 01:42:12,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:12,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:12,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:12,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 01:42:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:12,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 01:42:12,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:42:12,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:42:12,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032899600] [2022-04-05 01:42:12,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744033197] [2022-04-05 01:42:12,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744033197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:42:12,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:42:12,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:42:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357659931] [2022-04-05 01:42:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:42:12,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:42:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:42:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:42:12,701 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 01:42:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:12,756 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-05 01:42:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:42:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-05 01:42:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:12,761 INFO L225 Difference]: With dead ends: 48 [2022-04-05 01:42:12,761 INFO L226 Difference]: Without dead ends: 48 [2022-04-05 01:42:12,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:42:12,769 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:12,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 01:42:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-05 01:42:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-05 01:42:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-05 01:42:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-05 01:42:12,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-05 01:42:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:12,778 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-05 01:42:12,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 01:42:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-05 01:42:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 01:42:12,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:12,780 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:12,803 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-04-05 01:42:12,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:12,995 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-05 01:42:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:12,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088969529] [2022-04-05 01:42:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:13,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:13,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429986185] [2022-04-05 01:42:13,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:13,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:13,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:13,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:13,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 01:42:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:13,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 01:42:13,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 01:42:13,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:42:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088969529] [2022-04-05 01:42:13,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429986185] [2022-04-05 01:42:13,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429986185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:42:13,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:42:13,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:42:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458788191] [2022-04-05 01:42:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:42:13,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:42:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:42:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:42:13,128 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:42:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:13,186 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-05 01:42:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:42:13,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-05 01:42:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:13,187 INFO L225 Difference]: With dead ends: 52 [2022-04-05 01:42:13,187 INFO L226 Difference]: Without dead ends: 52 [2022-04-05 01:42:13,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:42:13,188 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:13,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 01:42:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-05 01:42:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-05 01:42:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-05 01:42:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-05 01:42:13,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-05 01:42:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:13,197 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-05 01:42:13,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:42:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-05 01:42:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-05 01:42:13,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:13,198 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:13,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:13,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:13,424 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-05 01:42:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:13,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893192807] [2022-04-05 01:42:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:13,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:13,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89957049] [2022-04-05 01:42:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:13,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:13,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:13,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:13,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 01:42:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:13,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 01:42:13,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-05 01:42:13,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:42:13,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893192807] [2022-04-05 01:42:13,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89957049] [2022-04-05 01:42:13,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89957049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:42:13,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:42:13,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:42:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517831648] [2022-04-05 01:42:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:42:13,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:42:13,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:42:13,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:42:13,596 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 01:42:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:13,672 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-05 01:42:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:42:13,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-05 01:42:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:13,674 INFO L225 Difference]: With dead ends: 60 [2022-04-05 01:42:13,674 INFO L226 Difference]: Without dead ends: 50 [2022-04-05 01:42:13,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:42:13,677 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:13,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-05 01:42:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-05 01:42:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-05 01:42:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-05 01:42:13,689 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-05 01:42:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:13,689 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-05 01:42:13,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 01:42:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-05 01:42:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 01:42:13,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:13,691 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:13,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:13,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:13,896 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-05 01:42:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:13,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337725716] [2022-04-05 01:42:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:13,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:13,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529946659] [2022-04-05 01:42:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:13,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 01:42:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:14,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 01:42:14,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-05 01:42:14,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-05 01:42:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:14,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337725716] [2022-04-05 01:42:14,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:14,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529946659] [2022-04-05 01:42:14,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529946659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:14,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:14,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-05 01:42:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289515962] [2022-04-05 01:42:14,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:14,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 01:42:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 01:42:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-05 01:42:14,283 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-05 01:42:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:14,418 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-05 01:42:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 01:42:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-05 01:42:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:14,424 INFO L225 Difference]: With dead ends: 104 [2022-04-05 01:42:14,425 INFO L226 Difference]: Without dead ends: 104 [2022-04-05 01:42:14,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-05 01:42:14,425 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:14,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 191 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-05 01:42:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-05 01:42:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-05 01:42:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-05 01:42:14,436 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-05 01:42:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:14,436 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-05 01:42:14,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-05 01:42:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-05 01:42:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 01:42:14,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:14,440 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:14,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:14,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:14,658 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:14,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-04-05 01:42:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:14,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241101325] [2022-04-05 01:42:14,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:14,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:14,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498591024] [2022-04-05 01:42:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:14,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:14,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:14,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 01:42:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:14,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 01:42:14,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-05 01:42:14,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-05 01:42:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:15,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241101325] [2022-04-05 01:42:15,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:15,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498591024] [2022-04-05 01:42:15,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498591024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:15,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:15,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-05 01:42:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856509595] [2022-04-05 01:42:15,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:15,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 01:42:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 01:42:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-05 01:42:15,010 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-05 01:42:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:15,331 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-05 01:42:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:42:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-05 01:42:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:15,333 INFO L225 Difference]: With dead ends: 116 [2022-04-05 01:42:15,333 INFO L226 Difference]: Without dead ends: 116 [2022-04-05 01:42:15,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-05 01:42:15,334 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:15,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 01:42:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-05 01:42:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-05 01:42:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-05 01:42:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-05 01:42:15,343 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-05 01:42:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:15,344 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-05 01:42:15,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-05 01:42:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-05 01:42:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 01:42:15,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:15,345 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:15,372 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-04-05 01:42:15,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:15,562 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-04-05 01:42:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:15,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466876815] [2022-04-05 01:42:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:15,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:15,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984157673] [2022-04-05 01:42:15,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 01:42:15,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:15,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:15,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:15,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 01:42:15,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 01:42:15,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:15,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 01:42:15,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 01:42:15,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 01:42:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:15,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466876815] [2022-04-05 01:42:15,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:15,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984157673] [2022-04-05 01:42:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984157673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:15,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:15,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-05 01:42:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706800512] [2022-04-05 01:42:15,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:15,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 01:42:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 01:42:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-05 01:42:15,882 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-05 01:42:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:15,992 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-05 01:42:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 01:42:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-05 01:42:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:15,997 INFO L225 Difference]: With dead ends: 120 [2022-04-05 01:42:15,997 INFO L226 Difference]: Without dead ends: 120 [2022-04-05 01:42:15,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-05 01:42:16,000 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:16,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 208 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-05 01:42:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-05 01:42:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-05 01:42:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-05 01:42:16,020 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-05 01:42:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:16,020 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-05 01:42:16,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-05 01:42:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-05 01:42:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-05 01:42:16,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:16,021 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:16,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:16,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:16,241 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-04-05 01:42:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:16,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214859780] [2022-04-05 01:42:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:16,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:16,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850585739] [2022-04-05 01:42:16,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 01:42:16,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:16,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:16,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:16,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-05 01:42:16,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-05 01:42:16,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:16,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-05 01:42:16,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-05 01:42:16,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-05 01:42:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:16,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214859780] [2022-04-05 01:42:16,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:16,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850585739] [2022-04-05 01:42:16,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850585739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:16,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:16,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-05 01:42:16,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781600319] [2022-04-05 01:42:16,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:16,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 01:42:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 01:42:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 01:42:16,691 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-05 01:42:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:17,225 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2022-04-05 01:42:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:42:17,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-05 01:42:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:17,226 INFO L225 Difference]: With dead ends: 144 [2022-04-05 01:42:17,226 INFO L226 Difference]: Without dead ends: 135 [2022-04-05 01:42:17,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:42:17,227 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:17,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 01:42:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-05 01:42:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-05 01:42:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-05 01:42:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-05 01:42:17,233 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-05 01:42:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:17,234 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-05 01:42:17,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-05 01:42:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-05 01:42:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-05 01:42:17,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:17,235 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:17,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:17,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:17,448 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-04-05 01:42:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:17,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140620662] [2022-04-05 01:42:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:17,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422104907] [2022-04-05 01:42:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:17,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:17,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-05 01:42:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:17,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-05 01:42:17,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-05 01:42:18,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-05 01:42:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140620662] [2022-04-05 01:42:18,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422104907] [2022-04-05 01:42:18,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422104907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:18,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:18,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-05 01:42:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241732889] [2022-04-05 01:42:18,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:18,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 01:42:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 01:42:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:42:18,522 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-05 01:42:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:18,851 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-04-05 01:42:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 01:42:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-05 01:42:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:18,853 INFO L225 Difference]: With dead ends: 146 [2022-04-05 01:42:18,853 INFO L226 Difference]: Without dead ends: 144 [2022-04-05 01:42:18,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-05 01:42:18,854 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:18,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 173 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 01:42:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-05 01:42:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-05 01:42:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-05 01:42:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-05 01:42:18,859 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-05 01:42:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:18,859 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-05 01:42:18,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-05 01:42:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-05 01:42:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-05 01:42:18,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:18,861 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:18,886 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-04-05 01:42:19,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-05 01:42:19,072 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-04-05 01:42:19,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:19,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884558739] [2022-04-05 01:42:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:19,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:19,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616503444] [2022-04-05 01:42:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:19,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:19,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:19,083 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-04-05 01:42:19,106 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-04-05 01:42:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:42:19,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-05 01:42:19,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-05 01:42:19,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:19,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884558739] [2022-04-05 01:42:19,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:19,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616503444] [2022-04-05 01:42:19,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616503444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:42:19,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:42:19,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-05 01:42:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475529584] [2022-04-05 01:42:19,799 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:19,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 01:42:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 01:42:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:42:19,800 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-05 01:42:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:19,914 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-04-05 01:42:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:42:19,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-05 01:42:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:19,916 INFO L225 Difference]: With dead ends: 141 [2022-04-05 01:42:19,916 INFO L226 Difference]: Without dead ends: 132 [2022-04-05 01:42:19,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 01:42:19,917 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:19,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-05 01:42:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-05 01:42:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-05 01:42:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-05 01:42:19,921 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-05 01:42:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:19,921 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-05 01:42:19,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-05 01:42:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-05 01:42:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-05 01:42:19,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:19,923 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:19,946 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-04-05 01:42:20,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:20,142 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-04-05 01:42:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:20,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920258407] [2022-04-05 01:42:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:20,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:20,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564703383] [2022-04-05 01:42:20,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 01:42:20,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:20,154 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-04-05 01:42:20,156 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-04-05 01:42:21,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 01:42:21,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:21,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-05 01:42:21,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 47 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-04-05 01:42:21,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-05 01:42:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920258407] [2022-04-05 01:42:22,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564703383] [2022-04-05 01:42:22,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564703383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:22,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:22,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-05 01:42:22,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353959819] [2022-04-05 01:42:22,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:22,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 01:42:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:22,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 01:42:22,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-05 01:42:22,264 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-05 01:42:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:23,697 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-04-05 01:42:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:42:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-05 01:42:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:23,698 INFO L225 Difference]: With dead ends: 140 [2022-04-05 01:42:23,698 INFO L226 Difference]: Without dead ends: 138 [2022-04-05 01:42:23,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-05 01:42:23,698 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:23,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 80 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-05 01:42:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-05 01:42:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-05 01:42:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-05 01:42:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-05 01:42:23,703 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-05 01:42:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:23,703 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-05 01:42:23,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-05 01:42:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-05 01:42:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-05 01:42:23,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:23,704 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:23,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:23,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-05 01:42:23,911 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-04-05 01:42:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001363251] [2022-04-05 01:42:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:23,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020936432] [2022-04-05 01:42:23,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 01:42:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:23,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:23,923 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:23,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-05 01:42:23,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 01:42:23,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:23,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-05 01:42:24,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-05 01:42:24,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001363251] [2022-04-05 01:42:24,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020936432] [2022-04-05 01:42:24,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020936432] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:42:24,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:42:24,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-05 01:42:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970592201] [2022-04-05 01:42:24,550 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:24,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 01:42:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 01:42:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-05 01:42:24,551 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 01:42:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:24,717 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-04-05 01:42:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 01:42:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-05 01:42:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:24,719 INFO L225 Difference]: With dead ends: 138 [2022-04-05 01:42:24,719 INFO L226 Difference]: Without dead ends: 129 [2022-04-05 01:42:24,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-05 01:42:24,720 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:24,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 01:42:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-05 01:42:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-05 01:42:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-05 01:42:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-05 01:42:24,724 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-05 01:42:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:24,725 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-05 01:42:24,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 01:42:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-05 01:42:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-05 01:42:24,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:24,726 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:24,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-05 01:42:24,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-05 01:42:24,939 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-04-05 01:42:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:24,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886529432] [2022-04-05 01:42:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:24,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:24,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472733613] [2022-04-05 01:42:24,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 01:42:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:24,964 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:24,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-05 01:42:25,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 01:42:25,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:25,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-05 01:42:25,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-05 01:42:25,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:25,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886529432] [2022-04-05 01:42:25,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:25,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472733613] [2022-04-05 01:42:25,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472733613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:42:25,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:42:25,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-05 01:42:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165385586] [2022-04-05 01:42:25,683 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:25,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 01:42:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 01:42:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-05 01:42:25,684 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-05 01:42:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:25,946 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-05 01:42:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 01:42:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-05 01:42:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:25,947 INFO L225 Difference]: With dead ends: 150 [2022-04-05 01:42:25,947 INFO L226 Difference]: Without dead ends: 150 [2022-04-05 01:42:25,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-05 01:42:25,947 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:25,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 01:42:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-05 01:42:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-05 01:42:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-05 01:42:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-05 01:42:25,957 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-05 01:42:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:25,958 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-05 01:42:25,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-05 01:42:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-05 01:42:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-05 01:42:25,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:25,960 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:25,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:26,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-05 01:42:26,175 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:26,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-04-05 01:42:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140763032] [2022-04-05 01:42:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:26,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:26,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656872239] [2022-04-05 01:42:26,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 01:42:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:26,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:26,186 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:26,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-05 01:42:26,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 01:42:26,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:26,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 01:42:26,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-05 01:42:26,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-05 01:42:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:26,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140763032] [2022-04-05 01:42:26,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:26,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656872239] [2022-04-05 01:42:26,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656872239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:26,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:26,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-05 01:42:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953663380] [2022-04-05 01:42:26,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:26,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 01:42:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 01:42:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-05 01:42:26,754 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-05 01:42:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:27,040 INFO L93 Difference]: Finished difference Result 355 states and 369 transitions. [2022-04-05 01:42:27,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-05 01:42:27,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-05 01:42:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:27,042 INFO L225 Difference]: With dead ends: 355 [2022-04-05 01:42:27,043 INFO L226 Difference]: Without dead ends: 353 [2022-04-05 01:42:27,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-05 01:42:27,043 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:27,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 264 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 01:42:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-05 01:42:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-05 01:42:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-05 01:42:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-05 01:42:27,056 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-05 01:42:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:27,057 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-05 01:42:27,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-05 01:42:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-05 01:42:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-05 01:42:27,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:27,058 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:27,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:27,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-05 01:42:27,265 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:27,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:27,266 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-04-05 01:42:27,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:27,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931264894] [2022-04-05 01:42:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:27,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:27,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:27,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921919921] [2022-04-05 01:42:27,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 01:42:27,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:27,279 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:27,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-05 01:42:27,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-05 01:42:27,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:27,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-05 01:42:27,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-05 01:42:28,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:28,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:28,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931264894] [2022-04-05 01:42:28,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:28,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921919921] [2022-04-05 01:42:28,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921919921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:42:28,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:42:28,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-05 01:42:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886318776] [2022-04-05 01:42:28,389 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:28,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 01:42:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:28,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 01:42:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-05 01:42:28,390 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-05 01:42:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:28,588 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-05 01:42:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 01:42:28,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-05 01:42:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:28,591 INFO L225 Difference]: With dead ends: 311 [2022-04-05 01:42:28,591 INFO L226 Difference]: Without dead ends: 302 [2022-04-05 01:42:28,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-05 01:42:28,592 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:28,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 01:42:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-05 01:42:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-05 01:42:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-05 01:42:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-05 01:42:28,618 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-05 01:42:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:28,620 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-05 01:42:28,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-05 01:42:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-05 01:42:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-05 01:42:28,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:28,622 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:28,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:28,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:28,828 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-04-05 01:42:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:28,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104293509] [2022-04-05 01:42:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:28,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065396257] [2022-04-05 01:42:28,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 01:42:28,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:28,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:28,839 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:28,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-05 01:42:29,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-05 01:42:29,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:29,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 01:42:29,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-05 01:42:29,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-05 01:42:30,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:30,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104293509] [2022-04-05 01:42:30,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:30,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065396257] [2022-04-05 01:42:30,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065396257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 01:42:30,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 01:42:30,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-05 01:42:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028340193] [2022-04-05 01:42:30,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:30,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 01:42:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 01:42:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 01:42:30,327 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-05 01:42:33,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 01:42:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:33,280 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-05 01:42:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 01:42:33,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-05 01:42:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:33,282 INFO L225 Difference]: With dead ends: 309 [2022-04-05 01:42:33,282 INFO L226 Difference]: Without dead ends: 309 [2022-04-05 01:42:33,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-05 01:42:33,283 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:33,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-05 01:42:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-05 01:42:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-05 01:42:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-05 01:42:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-05 01:42:33,291 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-05 01:42:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:33,292 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-05 01:42:33,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-05 01:42:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-05 01:42:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-05 01:42:33,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:33,293 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:33,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:33,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-05 01:42:33,493 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-04-05 01:42:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:33,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277848320] [2022-04-05 01:42:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:33,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:33,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075850610] [2022-04-05 01:42:33,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 01:42:33,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:33,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:33,503 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:33,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-05 01:42:35,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 01:42:35,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:42:35,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-05 01:42:35,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:42:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 234 proven. 352 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2022-04-05 01:42:35,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:42:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:42:36,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277848320] [2022-04-05 01:42:36,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:42:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075850610] [2022-04-05 01:42:36,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075850610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:42:36,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:42:36,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-05 01:42:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851673118] [2022-04-05 01:42:36,304 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:42:36,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 01:42:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:42:36,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 01:42:36,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-05 01:42:36,305 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-05 01:42:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:42:36,577 INFO L93 Difference]: Finished difference Result 337 states and 344 transitions. [2022-04-05 01:42:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 01:42:36,578 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 160 [2022-04-05 01:42:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:42:36,579 INFO L225 Difference]: With dead ends: 337 [2022-04-05 01:42:36,579 INFO L226 Difference]: Without dead ends: 297 [2022-04-05 01:42:36,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 183 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-04-05 01:42:36,580 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 01:42:36,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 120 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 186 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-04-05 01:42:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-05 01:42:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-04-05 01:42:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 189 states have (on average 1.0105820105820107) internal successors, (191), 190 states have internal predecessors, (191), 55 states have call successors, (55), 53 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-05 01:42:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 299 transitions. [2022-04-05 01:42:36,587 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 299 transitions. Word has length 160 [2022-04-05 01:42:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:42:36,587 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 299 transitions. [2022-04-05 01:42:36,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-05 01:42:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 299 transitions. [2022-04-05 01:42:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-05 01:42:36,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:42:36,589 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:36,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-05 01:42:36,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:36,797 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:42:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:42:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-04-05 01:42:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:42:36,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801623805] [2022-04-05 01:42:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:42:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:42:36,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:42:36,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761595776] [2022-04-05 01:42:36,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 01:42:36,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:42:36,815 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:42:36,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-05 01:42:37,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2022-04-05 01:42:37,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-05 01:42:37,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-05 01:42:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 01:42:37,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-05 01:42:37,370 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-05 01:42:37,371 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 01:42:37,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-05 01:42:37,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:42:37,581 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-04-05 01:42:37,584 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 01:42:37,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 01:42:37 BasicIcfg [2022-04-05 01:42:37,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 01:42:37,661 INFO L158 Benchmark]: Toolchain (without parser) took 26824.06ms. Allocated memory was 223.3MB in the beginning and 318.8MB in the end (delta: 95.4MB). Free memory was 172.7MB in the beginning and 159.8MB in the end (delta: 12.9MB). Peak memory consumption was 109.4MB. Max. memory is 8.0GB. [2022-04-05 01:42:37,662 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 223.3MB. Free memory was 189.5MB in the beginning and 189.5MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 01:42:37,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.39ms. Allocated memory is still 223.3MB. Free memory was 172.5MB in the beginning and 199.1MB in the end (delta: -26.6MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-04-05 01:42:37,662 INFO L158 Benchmark]: Boogie Preprocessor took 41.74ms. Allocated memory is still 223.3MB. Free memory was 199.1MB in the beginning and 197.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 01:42:37,662 INFO L158 Benchmark]: RCFGBuilder took 275.31ms. Allocated memory is still 223.3MB. Free memory was 197.7MB in the beginning and 186.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-05 01:42:37,662 INFO L158 Benchmark]: IcfgTransformer took 19.96ms. Allocated memory is still 223.3MB. Free memory was 186.6MB in the beginning and 185.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 01:42:37,663 INFO L158 Benchmark]: TraceAbstraction took 26184.43ms. Allocated memory was 223.3MB in the beginning and 318.8MB in the end (delta: 95.4MB). Free memory was 184.6MB in the beginning and 159.8MB in the end (delta: 24.8MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. [2022-04-05 01:42:37,664 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 223.3MB. Free memory was 189.5MB in the beginning and 189.5MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.39ms. Allocated memory is still 223.3MB. Free memory was 172.5MB in the beginning and 199.1MB in the end (delta: -26.6MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.74ms. Allocated memory is still 223.3MB. Free memory was 199.1MB in the beginning and 197.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.31ms. Allocated memory is still 223.3MB. Free memory was 197.7MB in the beginning and 186.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.96ms. Allocated memory is still 223.3MB. Free memory was 186.6MB in the beginning and 185.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26184.43ms. Allocated memory was 223.3MB in the beginning and 318.8MB in the end (delta: 95.4MB). Free memory was 184.6MB in the beginning and 159.8MB in the end (delta: 24.8MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=15, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 20, TraceHistogramMax: 52, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 2776 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 1921 mSDsCounter, 451 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2732 IncrementalHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 451 mSolverCounterUnsat, 855 mSDtfsCounter, 2732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2187 GetRequests, 1983 SyntacticMatches, 21 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=16, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1929 ConstructedInterpolants, 3 QuantifiedInterpolants, 8771 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2863 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 9709/11036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-05 01:42:37,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...