/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 01:35:23,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 01:35:23,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 01:35:24,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 01:35:24,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 01:35:24,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 01:35:24,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 01:35:24,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 01:35:24,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 01:35:24,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 01:35:24,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 01:35:24,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 01:35:24,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 01:35:24,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 01:35:24,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 01:35:24,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 01:35:24,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 01:35:24,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 01:35:24,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 01:35:24,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 01:35:24,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 01:35:24,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 01:35:24,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 01:35:24,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 01:35:24,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 01:35:24,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 01:35:24,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 01:35:24,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 01:35:24,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 01:35:24,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 01:35:24,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 01:35:24,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 01:35:24,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 01:35:24,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 01:35:24,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 01:35:24,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 01:35:24,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 01:35:24,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 01:35:24,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 01:35:24,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 01:35:24,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 01:35:24,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 01:35:24,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 01:35:24,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 01:35:24,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 01:35:24,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 01:35:24,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 01:35:24,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:35:24,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 01:35:24,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 01:35:24,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 01:35:24,059 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 01:35:24,059 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 01:35:24,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 01:35:24,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 01:35:24,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 01:35:24,268 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 01:35:24,269 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 01:35:24,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-02-15 01:35:24,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b429de364/855f6b68a7834e7b91537b6fcb414a54/FLAG15e7beb6a [2022-02-15 01:35:24,702 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 01:35:24,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-02-15 01:35:24,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b429de364/855f6b68a7834e7b91537b6fcb414a54/FLAG15e7beb6a [2022-02-15 01:35:24,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b429de364/855f6b68a7834e7b91537b6fcb414a54 [2022-02-15 01:35:24,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 01:35:24,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 01:35:24,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 01:35:24,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 01:35:24,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 01:35:24,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:24,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf0eaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24, skipping insertion in model container [2022-02-15 01:35:24,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:24,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 01:35:24,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 01:35:24,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-02-15 01:35:24,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:35:24,953 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 01:35:24,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-02-15 01:35:24,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:35:24,996 INFO L208 MainTranslator]: Completed translation [2022-02-15 01:35:24,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24 WrapperNode [2022-02-15 01:35:24,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 01:35:24,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 01:35:24,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 01:35:24,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 01:35:25,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 01:35:25,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 01:35:25,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 01:35:25,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 01:35:25,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (1/1) ... [2022-02-15 01:35:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:35:25,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 01:35:25,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 01:35:25,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 01:35:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 01:35:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 01:35:25,090 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 01:35:25,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 01:35:25,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 01:35:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 01:35:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 01:35:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 01:35:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 01:35:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 01:35:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 01:35:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 01:35:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 01:35:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 01:35:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 01:35:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 01:35:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 01:35:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 01:35:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 01:35:25,142 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 01:35:25,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 01:35:25,293 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 01:35:25,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 01:35:25,301 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-15 01:35:25,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:35:25 BoogieIcfgContainer [2022-02-15 01:35:25,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 01:35:25,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 01:35:25,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 01:35:25,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 01:35:25,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:35:24" (1/3) ... [2022-02-15 01:35:25,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8b3f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:35:25, skipping insertion in model container [2022-02-15 01:35:25,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:24" (2/3) ... [2022-02-15 01:35:25,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8b3f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:35:25, skipping insertion in model container [2022-02-15 01:35:25,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:35:25" (3/3) ... [2022-02-15 01:35:25,307 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2022-02-15 01:35:25,310 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 01:35:25,311 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 01:35:25,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 01:35:25,344 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-02-15 01:35:25,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 01:35:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 01:35:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:25,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:25,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:25,365 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash 66787427, now seen corresponding path program 1 times [2022-02-15 01:35:25,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:25,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1709738994] [2022-02-15 01:35:25,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:25,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:25,427 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:25,588 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:25,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1709738994] [2022-02-15 01:35:25,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1709738994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:25,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:25,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 01:35:25,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014135358] [2022-02-15 01:35:25,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:25,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 01:35:25,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 01:35:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:35:25,618 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:25,775 INFO L93 Difference]: Finished difference Result 60 states and 98 transitions. [2022-02-15 01:35:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:35:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:25,782 INFO L225 Difference]: With dead ends: 60 [2022-02-15 01:35:25,782 INFO L226 Difference]: Without dead ends: 29 [2022-02-15 01:35:25,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-15 01:35:25,786 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:25,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 46 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:35:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-15 01:35:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-15 01:35:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-02-15 01:35:25,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 27 [2022-02-15 01:35:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:25,818 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-15 01:35:25,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-15 01:35:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:25,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:25,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:25,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 01:35:25,819 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1388086372, now seen corresponding path program 1 times [2022-02-15 01:35:25,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:25,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [182593147] [2022-02-15 01:35:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:25,822 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:25,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:25,863 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:25,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [182593147] [2022-02-15 01:35:25,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [182593147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:25,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:25,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 01:35:25,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215189258] [2022-02-15 01:35:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:25,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 01:35:25,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 01:35:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 01:35:25,866 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:25,972 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2022-02-15 01:35:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 01:35:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:25,974 INFO L225 Difference]: With dead ends: 58 [2022-02-15 01:35:25,974 INFO L226 Difference]: Without dead ends: 43 [2022-02-15 01:35:25,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:35:25,976 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:25,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 29 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:35:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-15 01:35:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-15 01:35:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-02-15 01:35:25,989 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 27 [2022-02-15 01:35:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:25,989 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-15 01:35:25,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-15 01:35:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:25,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:25,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:25,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 01:35:25,991 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2120308874, now seen corresponding path program 1 times [2022-02-15 01:35:25,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:25,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981205187] [2022-02-15 01:35:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:25,994 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:26,072 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:26,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981205187] [2022-02-15 01:35:26,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [981205187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:26,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:26,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:35:26,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88271351] [2022-02-15 01:35:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:26,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:35:26,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:35:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:35:26,077 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:26,189 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-02-15 01:35:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:35:26,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:26,191 INFO L225 Difference]: With dead ends: 58 [2022-02-15 01:35:26,191 INFO L226 Difference]: Without dead ends: 41 [2022-02-15 01:35:26,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:35:26,194 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:26,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 42 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:35:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-15 01:35:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-15 01:35:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-02-15 01:35:26,202 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2022-02-15 01:35:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:26,203 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-02-15 01:35:26,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-15 01:35:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:26,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:26,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:26,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 01:35:26,204 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 80992202, now seen corresponding path program 1 times [2022-02-15 01:35:26,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:26,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283006635] [2022-02-15 01:35:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:26,211 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:26,293 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:26,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283006635] [2022-02-15 01:35:26,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [283006635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:26,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:26,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:35:26,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172783512] [2022-02-15 01:35:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:26,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:35:26,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:35:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:35:26,295 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:26,410 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-02-15 01:35:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 01:35:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:26,411 INFO L225 Difference]: With dead ends: 52 [2022-02-15 01:35:26,411 INFO L226 Difference]: Without dead ends: 37 [2022-02-15 01:35:26,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:35:26,413 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:26,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 41 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:35:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-15 01:35:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-15 01:35:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-02-15 01:35:26,418 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2022-02-15 01:35:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:26,418 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-02-15 01:35:26,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-15 01:35:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:26,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:26,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:26,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 01:35:26,419 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:26,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2094273526, now seen corresponding path program 1 times [2022-02-15 01:35:26,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:26,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922218304] [2022-02-15 01:35:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:26,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:26,421 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:26,499 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:26,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922218304] [2022-02-15 01:35:26,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [922218304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:26,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:26,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:35:26,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482699883] [2022-02-15 01:35:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:26,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:35:26,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:35:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:35:26,501 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:26,614 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-15 01:35:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 01:35:26,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:26,617 INFO L225 Difference]: With dead ends: 44 [2022-02-15 01:35:26,617 INFO L226 Difference]: Without dead ends: 33 [2022-02-15 01:35:26,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-02-15 01:35:26,625 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:26,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 30 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:35:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-15 01:35:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-15 01:35:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-02-15 01:35:26,633 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2022-02-15 01:35:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:26,634 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-02-15 01:35:26,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-15 01:35:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:26,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:26,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:26,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 01:35:26,635 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2013335789, now seen corresponding path program 1 times [2022-02-15 01:35:26,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:26,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825809944] [2022-02-15 01:35:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:26,637 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:26,680 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:26,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825809944] [2022-02-15 01:35:26,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [825809944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:26,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:26,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 01:35:26,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410897538] [2022-02-15 01:35:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:26,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 01:35:26,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 01:35:26,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 01:35:26,681 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:26,720 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-15 01:35:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 01:35:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:26,721 INFO L225 Difference]: With dead ends: 36 [2022-02-15 01:35:26,721 INFO L226 Difference]: Without dead ends: 33 [2022-02-15 01:35:26,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:35:26,722 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:26,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:35:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-15 01:35:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-15 01:35:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-02-15 01:35:26,726 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-02-15 01:35:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:26,726 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-02-15 01:35:26,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-15 01:35:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:35:26,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:26,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:26,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 01:35:26,727 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2013901818, now seen corresponding path program 1 times [2022-02-15 01:35:26,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:26,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1543678579] [2022-02-15 01:35:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:26,729 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:35:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:26,813 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:26,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1543678579] [2022-02-15 01:35:26,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1543678579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:26,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:26,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 01:35:26,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531191022] [2022-02-15 01:35:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:26,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 01:35:26,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 01:35:26,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:35:26,815 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:26,962 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-15 01:35:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 01:35:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:35:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:26,965 INFO L225 Difference]: With dead ends: 38 [2022-02-15 01:35:26,966 INFO L226 Difference]: Without dead ends: 31 [2022-02-15 01:35:26,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:35:26,968 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:26,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:35:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-15 01:35:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-15 01:35:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-02-15 01:35:26,974 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2022-02-15 01:35:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:26,975 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-02-15 01:35:26,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-15 01:35:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 01:35:26,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:26,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:35:26,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 01:35:26,979 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2072871847, now seen corresponding path program 1 times [2022-02-15 01:35:26,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:26,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [919468953] [2022-02-15 01:35:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:27,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:27,100 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:35:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:27,218 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:27,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [919468953] [2022-02-15 01:35:27,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [919468953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:27,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:27,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:35:27,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570286751] [2022-02-15 01:35:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:27,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:35:27,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:27,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:35:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:35:27,221 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:27,368 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-02-15 01:35:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:35:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-15 01:35:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:27,370 INFO L225 Difference]: With dead ends: 38 [2022-02-15 01:35:27,370 INFO L226 Difference]: Without dead ends: 33 [2022-02-15 01:35:27,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:35:27,371 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:27,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 32 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:35:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-15 01:35:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-15 01:35:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-15 01:35:27,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2022-02-15 01:35:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:27,381 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-15 01:35:27,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-15 01:35:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 01:35:27,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:27,382 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-02-15 01:35:27,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 01:35:27,382 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -928406012, now seen corresponding path program 1 times [2022-02-15 01:35:27,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:27,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299766085] [2022-02-15 01:35:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:27,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:27,426 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:35:27,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:27,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:27,541 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:27,921 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:27,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299766085] [2022-02-15 01:35:27,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [299766085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:27,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:27,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 01:35:27,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810468337] [2022-02-15 01:35:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:27,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 01:35:27,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 01:35:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:35:27,922 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:28,123 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-02-15 01:35:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 01:35:28,123 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-15 01:35:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:28,124 INFO L225 Difference]: With dead ends: 37 [2022-02-15 01:35:28,124 INFO L226 Difference]: Without dead ends: 34 [2022-02-15 01:35:28,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=485, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:35:28,125 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:28,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-02-15 01:35:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-15 01:35:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-15 01:35:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-02-15 01:35:28,129 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2022-02-15 01:35:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:28,129 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-02-15 01:35:28,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-15 01:35:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 01:35:28,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:28,130 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2022-02-15 01:35:28,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 01:35:28,130 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1147481854, now seen corresponding path program 2 times [2022-02-15 01:35:28,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:28,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355957083] [2022-02-15 01:35:28,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:28,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:28,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:28,231 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:28,253 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:28,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:28,305 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:28,737 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:28,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355957083] [2022-02-15 01:35:28,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [355957083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:28,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:28,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 01:35:28,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346999742] [2022-02-15 01:35:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:28,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 01:35:28,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:28,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 01:35:28,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:35:28,739 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:28,935 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-02-15 01:35:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 01:35:28,936 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-15 01:35:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:28,936 INFO L225 Difference]: With dead ends: 39 [2022-02-15 01:35:28,936 INFO L226 Difference]: Without dead ends: 36 [2022-02-15 01:35:28,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=538, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:35:28,937 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:28,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 44 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 63 Invalid, 0 Unknown, 46 Unchecked, 0.0s Time] [2022-02-15 01:35:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-15 01:35:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-15 01:35:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-02-15 01:35:28,944 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2022-02-15 01:35:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:28,944 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-02-15 01:35:28,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-02-15 01:35:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-15 01:35:28,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:28,946 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 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-02-15 01:35:28,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 01:35:28,949 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1084071560, now seen corresponding path program 3 times [2022-02-15 01:35:28,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:28,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [212296675] [2022-02-15 01:35:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:28,990 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,013 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:29,031 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,077 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,077 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:29,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:29,473 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:29,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [212296675] [2022-02-15 01:35:29,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [212296675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:29,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:29,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 01:35:29,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818127482] [2022-02-15 01:35:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:29,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 01:35:29,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 01:35:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:35:29,474 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:29,664 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-15 01:35:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 01:35:29,664 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-02-15 01:35:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:29,665 INFO L225 Difference]: With dead ends: 41 [2022-02-15 01:35:29,665 INFO L226 Difference]: Without dead ends: 38 [2022-02-15 01:35:29,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=593, Unknown=0, NotChecked=0, Total=870 [2022-02-15 01:35:29,665 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:29,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 44 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 75 Unchecked, 0.0s Time] [2022-02-15 01:35:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-15 01:35:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-15 01:35:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-02-15 01:35:29,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2022-02-15 01:35:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:29,670 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-02-15 01:35:29,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-02-15 01:35:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-15 01:35:29,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:29,671 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 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-02-15 01:35:29,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 01:35:29,671 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1876745586, now seen corresponding path program 4 times [2022-02-15 01:35:29,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:29,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367474942] [2022-02-15 01:35:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:29,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,744 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,744 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:29,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:29,818 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:30,241 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:30,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367474942] [2022-02-15 01:35:30,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [367474942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:30,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:30,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 01:35:30,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34311772] [2022-02-15 01:35:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:30,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 01:35:30,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 01:35:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:35:30,243 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:30,461 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-02-15 01:35:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 01:35:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-02-15 01:35:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:30,462 INFO L225 Difference]: With dead ends: 43 [2022-02-15 01:35:30,462 INFO L226 Difference]: Without dead ends: 40 [2022-02-15 01:35:30,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2022-02-15 01:35:30,463 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:30,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 51 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 96 Unchecked, 0.0s Time] [2022-02-15 01:35:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-15 01:35:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-15 01:35:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-02-15 01:35:30,470 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2022-02-15 01:35:30,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:30,470 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-02-15 01:35:30,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-02-15 01:35:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-15 01:35:30,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:30,471 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 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-02-15 01:35:30,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 01:35:30,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash -341294356, now seen corresponding path program 5 times [2022-02-15 01:35:30,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:30,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287408973] [2022-02-15 01:35:30,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:30,505 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:30,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:30,528 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:30,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:30,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:30,605 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:30,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:31,070 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:31,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287408973] [2022-02-15 01:35:31,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1287408973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:31,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:31,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 01:35:31,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131979446] [2022-02-15 01:35:31,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:31,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 01:35:31,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:31,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 01:35:31,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:35:31,071 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:31,285 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-02-15 01:35:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 01:35:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-02-15 01:35:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:31,285 INFO L225 Difference]: With dead ends: 45 [2022-02-15 01:35:31,286 INFO L226 Difference]: Without dead ends: 42 [2022-02-15 01:35:31,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2022-02-15 01:35:31,286 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:31,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 92 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2022-02-15 01:35:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-15 01:35:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-15 01:35:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-02-15 01:35:31,292 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2022-02-15 01:35:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:31,292 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-02-15 01:35:31,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-02-15 01:35:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 01:35:31,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:31,293 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 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-02-15 01:35:31,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 01:35:31,293 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1573899802, now seen corresponding path program 6 times [2022-02-15 01:35:31,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:31,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099752116] [2022-02-15 01:35:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:31,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:31,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:31,380 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:31,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:31,435 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:31,435 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:31,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:31,941 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:31,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099752116] [2022-02-15 01:35:31,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1099752116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:31,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:31,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:35:31,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248755432] [2022-02-15 01:35:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:31,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:35:31,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:35:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:35:31,942 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:32,154 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-02-15 01:35:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-15 01:35:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-02-15 01:35:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:32,155 INFO L225 Difference]: With dead ends: 47 [2022-02-15 01:35:32,155 INFO L226 Difference]: Without dead ends: 44 [2022-02-15 01:35:32,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2022-02-15 01:35:32,156 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:32,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 75 Invalid, 0 Unknown, 130 Unchecked, 0.0s Time] [2022-02-15 01:35:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-15 01:35:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-15 01:35:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2022-02-15 01:35:32,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2022-02-15 01:35:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:32,170 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2022-02-15 01:35:32,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-02-15 01:35:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-15 01:35:32,171 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:32,171 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 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-02-15 01:35:32,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 01:35:32,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash -696759712, now seen corresponding path program 7 times [2022-02-15 01:35:32,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:32,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608580133] [2022-02-15 01:35:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:32,220 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:32,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:32,241 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:32,260 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:32,314 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:32,314 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:32,871 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:32,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608580133] [2022-02-15 01:35:32,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [608580133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:32,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:32,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-15 01:35:32,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134432223] [2022-02-15 01:35:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:32,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 01:35:32,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:32,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 01:35:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-02-15 01:35:32,873 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:33,116 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-02-15 01:35:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 01:35:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-02-15 01:35:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:33,117 INFO L225 Difference]: With dead ends: 49 [2022-02-15 01:35:33,117 INFO L226 Difference]: Without dead ends: 46 [2022-02-15 01:35:33,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2022-02-15 01:35:33,120 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:33,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 80 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-02-15 01:35:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-15 01:35:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-15 01:35:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-02-15 01:35:33,129 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2022-02-15 01:35:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:33,129 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-02-15 01:35:33,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-02-15 01:35:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 01:35:33,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:33,130 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 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-02-15 01:35:33,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 01:35:33,130 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 421276762, now seen corresponding path program 8 times [2022-02-15 01:35:33,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:33,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966635710] [2022-02-15 01:35:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:33,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:33,192 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:33,192 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:33,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:33,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:33,251 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:33,895 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:33,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966635710] [2022-02-15 01:35:33,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1966635710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:33,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:33,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-15 01:35:33,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926472674] [2022-02-15 01:35:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:33,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-15 01:35:33,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-15 01:35:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-02-15 01:35:33,897 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:34,119 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-02-15 01:35:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 01:35:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-15 01:35:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:34,120 INFO L225 Difference]: With dead ends: 51 [2022-02-15 01:35:34,120 INFO L226 Difference]: Without dead ends: 48 [2022-02-15 01:35:34,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 01:35:34,121 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:34,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 83 Invalid, 0 Unknown, 172 Unchecked, 0.0s Time] [2022-02-15 01:35:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-15 01:35:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-15 01:35:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-02-15 01:35:34,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2022-02-15 01:35:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:34,128 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-02-15 01:35:34,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-02-15 01:35:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 01:35:34,128 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:34,128 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 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-02-15 01:35:34,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 01:35:34,129 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1112504276, now seen corresponding path program 9 times [2022-02-15 01:35:34,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:34,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1582873365] [2022-02-15 01:35:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:34,164 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:34,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:34,182 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:34,199 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:34,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:34,235 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:34,919 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:34,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1582873365] [2022-02-15 01:35:34,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1582873365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:34,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:34,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 01:35:34,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556457384] [2022-02-15 01:35:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:34,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 01:35:34,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 01:35:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:35:34,921 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:35,149 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-15 01:35:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 01:35:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-02-15 01:35:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:35,149 INFO L225 Difference]: With dead ends: 53 [2022-02-15 01:35:35,149 INFO L226 Difference]: Without dead ends: 50 [2022-02-15 01:35:35,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 01:35:35,150 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:35,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 76 Invalid, 0 Unknown, 193 Unchecked, 0.0s Time] [2022-02-15 01:35:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-15 01:35:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-15 01:35:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-02-15 01:35:35,159 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2022-02-15 01:35:35,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:35,160 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-02-15 01:35:35,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-02-15 01:35:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 01:35:35,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:35,161 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 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-02-15 01:35:35,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 01:35:35,161 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -337785650, now seen corresponding path program 10 times [2022-02-15 01:35:35,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:35,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122486005] [2022-02-15 01:35:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:35,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:35,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:35,230 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:35,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:35,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:35,286 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:35,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:35,962 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:35,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122486005] [2022-02-15 01:35:35,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [122486005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:35,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:35,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 01:35:35,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642830675] [2022-02-15 01:35:35,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:35,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 01:35:35,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:35,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 01:35:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-02-15 01:35:35,964 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:36,227 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-15 01:35:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-15 01:35:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-02-15 01:35:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:36,228 INFO L225 Difference]: With dead ends: 55 [2022-02-15 01:35:36,228 INFO L226 Difference]: Without dead ends: 52 [2022-02-15 01:35:36,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 01:35:36,229 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:36,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 214 Unchecked, 0.1s Time] [2022-02-15 01:35:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-15 01:35:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-15 01:35:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-02-15 01:35:36,237 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2022-02-15 01:35:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:36,237 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-02-15 01:35:36,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-15 01:35:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 01:35:36,238 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:36,238 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 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-02-15 01:35:36,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 01:35:36,238 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1797966664, now seen corresponding path program 11 times [2022-02-15 01:35:36,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:36,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755774805] [2022-02-15 01:35:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:36,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:36,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:36,311 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:36,336 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:36,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:36,394 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:37,114 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:37,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755774805] [2022-02-15 01:35:37,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1755774805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:37,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:37,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 01:35:37,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996887486] [2022-02-15 01:35:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:37,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 01:35:37,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 01:35:37,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:35:37,116 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:37,351 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-15 01:35:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:35:37,351 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-02-15 01:35:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:37,352 INFO L225 Difference]: With dead ends: 57 [2022-02-15 01:35:37,352 INFO L226 Difference]: Without dead ends: 54 [2022-02-15 01:35:37,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=1105, Unknown=0, NotChecked=0, Total=1406 [2022-02-15 01:35:37,353 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:37,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 100 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 243 Unchecked, 0.0s Time] [2022-02-15 01:35:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-15 01:35:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-15 01:35:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-02-15 01:35:37,361 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2022-02-15 01:35:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:37,361 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-02-15 01:35:37,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-15 01:35:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 01:35:37,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:37,361 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 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-02-15 01:35:37,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 01:35:37,361 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1261572930, now seen corresponding path program 12 times [2022-02-15 01:35:37,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:37,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [429218178] [2022-02-15 01:35:37,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:37,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:37,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:37,431 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:37,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:37,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:37,494 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:38,321 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:38,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [429218178] [2022-02-15 01:35:38,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [429218178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:38,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:38,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:35:38,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643583413] [2022-02-15 01:35:38,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:38,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 01:35:38,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:38,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 01:35:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:35:38,324 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:38,563 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-02-15 01:35:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-15 01:35:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-02-15 01:35:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:38,564 INFO L225 Difference]: With dead ends: 59 [2022-02-15 01:35:38,564 INFO L226 Difference]: Without dead ends: 56 [2022-02-15 01:35:38,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2022-02-15 01:35:38,565 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:38,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 260 Unchecked, 0.0s Time] [2022-02-15 01:35:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-15 01:35:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-15 01:35:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-02-15 01:35:38,573 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 53 [2022-02-15 01:35:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:38,574 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-02-15 01:35:38,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-15 01:35:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-15 01:35:38,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:38,574 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 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-02-15 01:35:38,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 01:35:38,574 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1183270076, now seen corresponding path program 13 times [2022-02-15 01:35:38,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:38,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640206317] [2022-02-15 01:35:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:38,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:38,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:38,632 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:38,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:38,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:38,690 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:39,498 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:39,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640206317] [2022-02-15 01:35:39,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1640206317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:39,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:39,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 01:35:39,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124105398] [2022-02-15 01:35:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:39,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 01:35:39,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 01:35:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2022-02-15 01:35:39,499 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:39,765 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-02-15 01:35:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-15 01:35:39,765 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-02-15 01:35:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:39,765 INFO L225 Difference]: With dead ends: 61 [2022-02-15 01:35:39,765 INFO L226 Difference]: Without dead ends: 58 [2022-02-15 01:35:39,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1253, Unknown=0, NotChecked=0, Total=1560 [2022-02-15 01:35:39,766 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:39,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 285 Unchecked, 0.0s Time] [2022-02-15 01:35:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-15 01:35:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-15 01:35:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-02-15 01:35:39,776 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 55 [2022-02-15 01:35:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:39,776 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-02-15 01:35:39,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-02-15 01:35:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-15 01:35:39,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:39,777 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 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-02-15 01:35:39,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 01:35:39,777 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:39,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1051328586, now seen corresponding path program 14 times [2022-02-15 01:35:39,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:39,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639211442] [2022-02-15 01:35:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:39,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:39,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:39,844 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:39,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:39,918 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:39,919 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:40,807 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:40,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639211442] [2022-02-15 01:35:40,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1639211442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:40,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:40,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 01:35:40,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869335194] [2022-02-15 01:35:40,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:40,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 01:35:40,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:40,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 01:35:40,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-02-15 01:35:40,809 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:41,058 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-02-15 01:35:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 01:35:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-02-15 01:35:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:41,060 INFO L225 Difference]: With dead ends: 63 [2022-02-15 01:35:41,060 INFO L226 Difference]: Without dead ends: 60 [2022-02-15 01:35:41,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 16 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=1330, Unknown=0, NotChecked=0, Total=1640 [2022-02-15 01:35:41,061 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:41,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 71 Invalid, 0 Unknown, 298 Unchecked, 0.0s Time] [2022-02-15 01:35:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-15 01:35:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-15 01:35:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-02-15 01:35:41,075 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2022-02-15 01:35:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:41,075 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-02-15 01:35:41,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-02-15 01:35:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 01:35:41,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:41,076 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 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-02-15 01:35:41,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 01:35:41,076 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1016994768, now seen corresponding path program 15 times [2022-02-15 01:35:41,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:41,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643247419] [2022-02-15 01:35:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:41,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:41,147 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:41,148 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:41,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:41,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:41,214 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:42,146 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:42,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643247419] [2022-02-15 01:35:42,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1643247419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:42,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:42,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 01:35:42,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290658229] [2022-02-15 01:35:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:42,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 01:35:42,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 01:35:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2022-02-15 01:35:42,148 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:42,417 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-02-15 01:35:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-15 01:35:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-02-15 01:35:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:42,418 INFO L225 Difference]: With dead ends: 65 [2022-02-15 01:35:42,418 INFO L226 Difference]: Without dead ends: 62 [2022-02-15 01:35:42,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1409, Unknown=0, NotChecked=0, Total=1722 [2022-02-15 01:35:42,422 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:42,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 142 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 72 Invalid, 0 Unknown, 320 Unchecked, 0.0s Time] [2022-02-15 01:35:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-15 01:35:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-15 01:35:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-02-15 01:35:42,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2022-02-15 01:35:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:42,433 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-02-15 01:35:42,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-02-15 01:35:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-15 01:35:42,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:42,434 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 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-02-15 01:35:42,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 01:35:42,434 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1913033258, now seen corresponding path program 16 times [2022-02-15 01:35:42,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:42,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892440223] [2022-02-15 01:35:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:42,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:42,497 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:42,497 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:42,521 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:42,557 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:42,557 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:42,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:43,560 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:43,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892440223] [2022-02-15 01:35:43,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [892440223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:43,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:43,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-02-15 01:35:43,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346853779] [2022-02-15 01:35:43,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:43,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-15 01:35:43,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-15 01:35:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2022-02-15 01:35:43,562 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 30 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:43,841 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2022-02-15 01:35:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-15 01:35:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-02-15 01:35:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:43,842 INFO L225 Difference]: With dead ends: 67 [2022-02-15 01:35:43,842 INFO L226 Difference]: Without dead ends: 64 [2022-02-15 01:35:43,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 18 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 01:35:43,843 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:43,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 156 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 76 Invalid, 0 Unknown, 340 Unchecked, 0.0s Time] [2022-02-15 01:35:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-15 01:35:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-15 01:35:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-02-15 01:35:43,855 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2022-02-15 01:35:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:43,855 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-02-15 01:35:43,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-02-15 01:35:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 01:35:43,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:43,856 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 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-02-15 01:35:43,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 01:35:43,856 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 171420068, now seen corresponding path program 17 times [2022-02-15 01:35:43,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:43,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457592563] [2022-02-15 01:35:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:43,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:43,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:43,925 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:43,941 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:43,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:43,986 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:45,116 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:45,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457592563] [2022-02-15 01:35:45,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1457592563] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:45,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:45,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-02-15 01:35:45,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541151465] [2022-02-15 01:35:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:45,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-15 01:35:45,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-15 01:35:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2022-02-15 01:35:45,118 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:45,383 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-02-15 01:35:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-15 01:35:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-02-15 01:35:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:45,384 INFO L225 Difference]: With dead ends: 69 [2022-02-15 01:35:45,384 INFO L226 Difference]: Without dead ends: 66 [2022-02-15 01:35:45,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2022-02-15 01:35:45,385 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:45,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 163 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 0 Unknown, 361 Unchecked, 0.0s Time] [2022-02-15 01:35:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-15 01:35:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-15 01:35:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-02-15 01:35:45,400 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2022-02-15 01:35:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:45,400 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-02-15 01:35:45,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-02-15 01:35:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-15 01:35:45,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:45,400 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 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-02-15 01:35:45,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 01:35:45,401 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1518389918, now seen corresponding path program 18 times [2022-02-15 01:35:45,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:45,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124749346] [2022-02-15 01:35:45,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:45,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:45,469 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:45,469 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:45,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:45,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:45,528 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:46,699 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:46,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124749346] [2022-02-15 01:35:46,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2124749346] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:46,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:46,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-02-15 01:35:46,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662434621] [2022-02-15 01:35:46,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:46,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-15 01:35:46,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:46,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-15 01:35:46,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 01:35:46,702 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:46,975 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-02-15 01:35:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 01:35:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-02-15 01:35:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:46,976 INFO L225 Difference]: With dead ends: 71 [2022-02-15 01:35:46,976 INFO L226 Difference]: Without dead ends: 68 [2022-02-15 01:35:46,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=322, Invalid=1658, Unknown=0, NotChecked=0, Total=1980 [2022-02-15 01:35:46,977 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:46,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 390 Unchecked, 0.0s Time] [2022-02-15 01:35:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-15 01:35:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-02-15 01:35:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-02-15 01:35:46,994 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2022-02-15 01:35:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:46,994 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-02-15 01:35:46,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-02-15 01:35:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 01:35:46,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:46,995 INFO L514 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 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-02-15 01:35:46,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 01:35:46,995 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1123707624, now seen corresponding path program 19 times [2022-02-15 01:35:46,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:46,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462269142] [2022-02-15 01:35:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:47,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:47,072 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:47,072 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:47,096 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:47,150 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:47,150 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:48,394 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:48,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462269142] [2022-02-15 01:35:48,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1462269142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:48,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:48,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-02-15 01:35:48,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679562594] [2022-02-15 01:35:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:48,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-15 01:35:48,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:48,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-15 01:35:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 01:35:48,396 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:48,678 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-02-15 01:35:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:35:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-02-15 01:35:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:48,679 INFO L225 Difference]: With dead ends: 73 [2022-02-15 01:35:48,679 INFO L226 Difference]: Without dead ends: 70 [2022-02-15 01:35:48,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=325, Invalid=1745, Unknown=0, NotChecked=0, Total=2070 [2022-02-15 01:35:48,680 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:48,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 156 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 411 Unchecked, 0.0s Time] [2022-02-15 01:35:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-15 01:35:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-02-15 01:35:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-02-15 01:35:48,706 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2022-02-15 01:35:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:48,706 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-02-15 01:35:48,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-15 01:35:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-15 01:35:48,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:48,707 INFO L514 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 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-02-15 01:35:48,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 01:35:48,707 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1853773550, now seen corresponding path program 20 times [2022-02-15 01:35:48,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:48,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873310624] [2022-02-15 01:35:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:48,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:48,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:48,775 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:48,791 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:48,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:48,836 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:50,104 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:50,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873310624] [2022-02-15 01:35:50,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [873310624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:50,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:50,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-02-15 01:35:50,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5983029] [2022-02-15 01:35:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:50,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-15 01:35:50,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-15 01:35:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 01:35:50,106 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:50,384 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-02-15 01:35:50,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-15 01:35:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-02-15 01:35:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:50,384 INFO L225 Difference]: With dead ends: 75 [2022-02-15 01:35:50,385 INFO L226 Difference]: Without dead ends: 72 [2022-02-15 01:35:50,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 22 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-02-15 01:35:50,385 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:50,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 67 Invalid, 0 Unknown, 424 Unchecked, 0.0s Time] [2022-02-15 01:35:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-15 01:35:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-15 01:35:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-02-15 01:35:50,419 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2022-02-15 01:35:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:50,419 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-02-15 01:35:50,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-02-15 01:35:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-15 01:35:50,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:50,420 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 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-02-15 01:35:50,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 01:35:50,420 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash 927508108, now seen corresponding path program 21 times [2022-02-15 01:35:50,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:50,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207676352] [2022-02-15 01:35:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:50,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:50,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:50,474 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:50,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:50,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:50,533 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:51,942 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:51,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207676352] [2022-02-15 01:35:51,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1207676352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:51,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:51,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-02-15 01:35:51,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103038022] [2022-02-15 01:35:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:51,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-15 01:35:51,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-15 01:35:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1234, Unknown=0, NotChecked=0, Total=1406 [2022-02-15 01:35:51,943 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:52,240 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-02-15 01:35:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-15 01:35:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-02-15 01:35:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:52,241 INFO L225 Difference]: With dead ends: 77 [2022-02-15 01:35:52,241 INFO L226 Difference]: Without dead ends: 74 [2022-02-15 01:35:52,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 23 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-02-15 01:35:52,242 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:52,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 184 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 72 Invalid, 0 Unknown, 449 Unchecked, 0.0s Time] [2022-02-15 01:35:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-15 01:35:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-15 01:35:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-02-15 01:35:52,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2022-02-15 01:35:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:52,261 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-02-15 01:35:52,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-02-15 01:35:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-15 01:35:52,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:52,262 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 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-02-15 01:35:52,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 01:35:52,262 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2025443962, now seen corresponding path program 22 times [2022-02-15 01:35:52,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:52,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874006433] [2022-02-15 01:35:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:52,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:52,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:52,341 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:52,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:52,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:52,389 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:52,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:53,825 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:53,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874006433] [2022-02-15 01:35:53,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1874006433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:53,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:53,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-02-15 01:35:53,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182405859] [2022-02-15 01:35:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:53,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-15 01:35:53,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:53,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-15 01:35:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2022-02-15 01:35:53,826 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:54,125 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-15 01:35:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-15 01:35:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-02-15 01:35:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:54,127 INFO L225 Difference]: With dead ends: 79 [2022-02-15 01:35:54,127 INFO L226 Difference]: Without dead ends: 76 [2022-02-15 01:35:54,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=2018, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 01:35:54,128 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:54,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 205 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 85 Invalid, 0 Unknown, 466 Unchecked, 0.0s Time] [2022-02-15 01:35:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-15 01:35:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-15 01:35:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-02-15 01:35:54,147 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2022-02-15 01:35:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:54,147 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-02-15 01:35:54,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-02-15 01:35:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-15 01:35:54,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:54,148 INFO L514 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 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-02-15 01:35:54,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 01:35:54,148 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -839000576, now seen corresponding path program 23 times [2022-02-15 01:35:54,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:54,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229831791] [2022-02-15 01:35:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:54,179 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:54,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:54,194 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:54,210 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:54,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:54,255 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:54,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:55,793 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:55,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229831791] [2022-02-15 01:35:55,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1229831791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:55,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:55,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-02-15 01:35:55,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029615244] [2022-02-15 01:35:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:55,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-15 01:35:55,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:55,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-15 01:35:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2022-02-15 01:35:55,795 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:56,113 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-02-15 01:35:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-15 01:35:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-02-15 01:35:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:56,114 INFO L225 Difference]: With dead ends: 81 [2022-02-15 01:35:56,114 INFO L226 Difference]: Without dead ends: 78 [2022-02-15 01:35:56,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 25 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=337, Invalid=2113, Unknown=0, NotChecked=0, Total=2450 [2022-02-15 01:35:56,115 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:56,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 219 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 487 Unchecked, 0.0s Time] [2022-02-15 01:35:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-15 01:35:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-15 01:35:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-02-15 01:35:56,136 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2022-02-15 01:35:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:56,136 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-02-15 01:35:56,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-15 01:35:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-15 01:35:56,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:56,137 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 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-02-15 01:35:56,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 01:35:56,137 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1166759930, now seen corresponding path program 24 times [2022-02-15 01:35:56,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:56,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1576677124] [2022-02-15 01:35:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:56,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:56,205 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:56,205 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:56,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:56,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:56,279 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:35:57,948 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:35:57,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1576677124] [2022-02-15 01:35:57,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1576677124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:35:57,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:35:57,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-02-15 01:35:57,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343825284] [2022-02-15 01:35:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:35:57,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-15 01:35:57,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:35:57,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-15 01:35:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2022-02-15 01:35:57,950 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:35:58,287 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-02-15 01:35:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-15 01:35:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-02-15 01:35:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:35:58,288 INFO L225 Difference]: With dead ends: 83 [2022-02-15 01:35:58,288 INFO L226 Difference]: Without dead ends: 80 [2022-02-15 01:35:58,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 26 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=340, Invalid=2210, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 01:35:58,291 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 508 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:35:58,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 205 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 78 Invalid, 0 Unknown, 508 Unchecked, 0.0s Time] [2022-02-15 01:35:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-15 01:35:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-02-15 01:35:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-02-15 01:35:58,323 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2022-02-15 01:35:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:35:58,323 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-02-15 01:35:58,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:35:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-02-15 01:35:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 01:35:58,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:35:58,324 INFO L514 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 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-02-15 01:35:58,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 01:35:58,324 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:35:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:35:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 262290292, now seen corresponding path program 25 times [2022-02-15 01:35:58,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:35:58,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396220470] [2022-02-15 01:35:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:35:58,366 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:58,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:58,386 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:58,403 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:58,448 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:35:58,448 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:35:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:35:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:35:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:35:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:00,210 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:00,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396220470] [2022-02-15 01:36:00,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1396220470] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:00,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:00,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-15 01:36:00,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032614132] [2022-02-15 01:36:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:00,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-15 01:36:00,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-15 01:36:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2022-02-15 01:36:00,211 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:00,561 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-15 01:36:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-15 01:36:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-02-15 01:36:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:00,562 INFO L225 Difference]: With dead ends: 85 [2022-02-15 01:36:00,562 INFO L226 Difference]: Without dead ends: 82 [2022-02-15 01:36:00,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 27 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=343, Invalid=2309, Unknown=0, NotChecked=0, Total=2652 [2022-02-15 01:36:00,562 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 535 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:00,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 535 Unchecked, 0.1s Time] [2022-02-15 01:36:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-15 01:36:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-02-15 01:36:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2022-02-15 01:36:00,592 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 79 [2022-02-15 01:36:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:00,592 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2022-02-15 01:36:00,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2022-02-15 01:36:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-15 01:36:00,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:00,593 INFO L514 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 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-02-15 01:36:00,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 01:36:00,593 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1349638034, now seen corresponding path program 26 times [2022-02-15 01:36:00,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:00,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507936040] [2022-02-15 01:36:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:00,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:00,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:00,643 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:00,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:00,693 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:00,693 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:00,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:02,486 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:02,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507936040] [2022-02-15 01:36:02,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [507936040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:02,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:02,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-15 01:36:02,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543102184] [2022-02-15 01:36:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:02,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-15 01:36:02,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-15 01:36:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 01:36:02,488 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 40 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:02,856 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-15 01:36:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-15 01:36:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-02-15 01:36:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:02,857 INFO L225 Difference]: With dead ends: 87 [2022-02-15 01:36:02,857 INFO L226 Difference]: Without dead ends: 84 [2022-02-15 01:36:02,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 28 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=346, Invalid=2410, Unknown=0, NotChecked=0, Total=2756 [2022-02-15 01:36:02,858 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:02,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 219 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 73 Invalid, 0 Unknown, 550 Unchecked, 0.1s Time] [2022-02-15 01:36:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-15 01:36:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-02-15 01:36:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2022-02-15 01:36:02,884 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2022-02-15 01:36:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:02,885 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2022-02-15 01:36:02,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-02-15 01:36:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-15 01:36:02,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:02,886 INFO L514 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 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-02-15 01:36:02,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 01:36:02,886 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash 70434536, now seen corresponding path program 27 times [2022-02-15 01:36:02,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:02,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1416636963] [2022-02-15 01:36:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:02,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:02,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:02,954 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:02,978 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:03,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:03,023 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:04,959 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:04,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1416636963] [2022-02-15 01:36:04,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1416636963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:04,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:04,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-02-15 01:36:04,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235678673] [2022-02-15 01:36:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:04,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-15 01:36:04,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-15 01:36:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1702, Unknown=0, NotChecked=0, Total=1892 [2022-02-15 01:36:04,960 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:05,292 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-02-15 01:36:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-15 01:36:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-02-15 01:36:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:05,292 INFO L225 Difference]: With dead ends: 89 [2022-02-15 01:36:05,293 INFO L226 Difference]: Without dead ends: 86 [2022-02-15 01:36:05,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=349, Invalid=2513, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 01:36:05,293 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:05,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 226 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 70 Invalid, 0 Unknown, 572 Unchecked, 0.0s Time] [2022-02-15 01:36:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-15 01:36:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-15 01:36:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-02-15 01:36:05,343 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2022-02-15 01:36:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:05,343 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-02-15 01:36:05,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-02-15 01:36:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-15 01:36:05,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:05,344 INFO L514 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 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-02-15 01:36:05,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 01:36:05,344 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:05,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1039425822, now seen corresponding path program 28 times [2022-02-15 01:36:05,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:05,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566149311] [2022-02-15 01:36:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:05,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:05,404 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:05,405 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:05,421 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:05,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:05,454 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:05,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:07,461 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:07,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566149311] [2022-02-15 01:36:07,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1566149311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:07,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:07,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-02-15 01:36:07,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568226694] [2022-02-15 01:36:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:07,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-15 01:36:07,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-15 01:36:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2022-02-15 01:36:07,463 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 42 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:07,800 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-02-15 01:36:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-02-15 01:36:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-02-15 01:36:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:07,801 INFO L225 Difference]: With dead ends: 91 [2022-02-15 01:36:07,801 INFO L226 Difference]: Without dead ends: 88 [2022-02-15 01:36:07,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=352, Invalid=2618, Unknown=0, NotChecked=0, Total=2970 [2022-02-15 01:36:07,802 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 593 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:07,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 233 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 81 Invalid, 0 Unknown, 593 Unchecked, 0.0s Time] [2022-02-15 01:36:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-15 01:36:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-15 01:36:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-02-15 01:36:07,831 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2022-02-15 01:36:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:07,831 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-02-15 01:36:07,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-02-15 01:36:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-15 01:36:07,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:07,832 INFO L514 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 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-02-15 01:36:07,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 01:36:07,832 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1831626844, now seen corresponding path program 29 times [2022-02-15 01:36:07,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:07,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607934992] [2022-02-15 01:36:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:07,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:07,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:07,889 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:07,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:07,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:07,954 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:08,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:10,031 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:10,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607934992] [2022-02-15 01:36:10,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1607934992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:10,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:10,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-02-15 01:36:10,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588321395] [2022-02-15 01:36:10,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:10,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-15 01:36:10,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:10,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-15 01:36:10,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2022-02-15 01:36:10,033 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:10,397 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-02-15 01:36:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-15 01:36:10,397 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-02-15 01:36:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:10,397 INFO L225 Difference]: With dead ends: 93 [2022-02-15 01:36:10,397 INFO L226 Difference]: Without dead ends: 90 [2022-02-15 01:36:10,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 31 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=355, Invalid=2725, Unknown=0, NotChecked=0, Total=3080 [2022-02-15 01:36:10,398 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 615 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:10,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 240 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 76 Invalid, 0 Unknown, 615 Unchecked, 0.0s Time] [2022-02-15 01:36:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-15 01:36:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-02-15 01:36:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2022-02-15 01:36:10,427 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2022-02-15 01:36:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:10,428 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2022-02-15 01:36:10,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-02-15 01:36:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-15 01:36:10,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:10,428 INFO L514 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 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-02-15 01:36:10,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 01:36:10,428 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -750732458, now seen corresponding path program 30 times [2022-02-15 01:36:10,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:10,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355548461] [2022-02-15 01:36:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:10,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:10,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:10,485 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:10,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:10,531 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:10,531 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:12,617 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:12,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355548461] [2022-02-15 01:36:12,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [355548461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:12,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:12,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-02-15 01:36:12,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085374764] [2022-02-15 01:36:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:12,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-15 01:36:12,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-15 01:36:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1963, Unknown=0, NotChecked=0, Total=2162 [2022-02-15 01:36:12,619 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:12,970 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-02-15 01:36:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-15 01:36:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-02-15 01:36:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:12,971 INFO L225 Difference]: With dead ends: 95 [2022-02-15 01:36:12,971 INFO L226 Difference]: Without dead ends: 92 [2022-02-15 01:36:12,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 5 SyntacticMatches, 32 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=358, Invalid=2834, Unknown=0, NotChecked=0, Total=3192 [2022-02-15 01:36:12,972 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:12,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 247 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 85 Invalid, 0 Unknown, 634 Unchecked, 0.0s Time] [2022-02-15 01:36:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-15 01:36:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-15 01:36:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-02-15 01:36:13,008 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 89 [2022-02-15 01:36:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:13,008 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-02-15 01:36:13,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-02-15 01:36:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-15 01:36:13,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:13,009 INFO L514 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 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-02-15 01:36:13,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 01:36:13,009 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash 93075408, now seen corresponding path program 31 times [2022-02-15 01:36:13,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:13,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1502968489] [2022-02-15 01:36:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:13,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:13,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:13,064 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:13,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:13,117 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:13,117 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:15,348 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:15,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1502968489] [2022-02-15 01:36:15,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1502968489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:15,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:15,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-02-15 01:36:15,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596698201] [2022-02-15 01:36:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:15,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-15 01:36:15,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-15 01:36:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2054, Unknown=0, NotChecked=0, Total=2256 [2022-02-15 01:36:15,349 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:15,691 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-02-15 01:36:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 01:36:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-02-15 01:36:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:15,691 INFO L225 Difference]: With dead ends: 97 [2022-02-15 01:36:15,691 INFO L226 Difference]: Without dead ends: 94 [2022-02-15 01:36:15,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 5 SyntacticMatches, 33 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=361, Invalid=2945, Unknown=0, NotChecked=0, Total=3306 [2022-02-15 01:36:15,692 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 655 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:15,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 254 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 655 Unchecked, 0.0s Time] [2022-02-15 01:36:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-15 01:36:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-15 01:36:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-02-15 01:36:15,725 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2022-02-15 01:36:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:15,725 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-02-15 01:36:15,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-02-15 01:36:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-15 01:36:15,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:15,725 INFO L514 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 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-02-15 01:36:15,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 01:36:15,725 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash -756384310, now seen corresponding path program 32 times [2022-02-15 01:36:15,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:15,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821331791] [2022-02-15 01:36:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:15,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:15,787 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:15,787 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:15,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:15,873 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:15,873 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:18,119 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:18,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821331791] [2022-02-15 01:36:18,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [821331791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:18,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:18,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-02-15 01:36:18,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909462572] [2022-02-15 01:36:18,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:18,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-15 01:36:18,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-15 01:36:18,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 01:36:18,121 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 46 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:18,477 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-02-15 01:36:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 01:36:18,480 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-02-15 01:36:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:18,480 INFO L225 Difference]: With dead ends: 99 [2022-02-15 01:36:18,480 INFO L226 Difference]: Without dead ends: 96 [2022-02-15 01:36:18,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 10 SyntacticMatches, 34 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=364, Invalid=3058, Unknown=0, NotChecked=0, Total=3422 [2022-02-15 01:36:18,481 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 681 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:18,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 254 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 681 Unchecked, 0.0s Time] [2022-02-15 01:36:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-15 01:36:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-15 01:36:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-02-15 01:36:18,516 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2022-02-15 01:36:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:18,516 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-02-15 01:36:18,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-02-15 01:36:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-15 01:36:18,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:18,516 INFO L514 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 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-02-15 01:36:18,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 01:36:18,517 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1043387068, now seen corresponding path program 33 times [2022-02-15 01:36:18,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:18,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1736744977] [2022-02-15 01:36:18,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:18,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:18,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:18,583 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:18,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:18,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:18,635 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:20,979 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:20,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1736744977] [2022-02-15 01:36:20,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1736744977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:20,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:20,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-02-15 01:36:20,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051173643] [2022-02-15 01:36:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:20,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-15 01:36:20,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-15 01:36:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2242, Unknown=0, NotChecked=0, Total=2450 [2022-02-15 01:36:20,981 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:21,360 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-02-15 01:36:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-15 01:36:21,360 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-02-15 01:36:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:21,361 INFO L225 Difference]: With dead ends: 101 [2022-02-15 01:36:21,361 INFO L226 Difference]: Without dead ends: 98 [2022-02-15 01:36:21,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 13 SyntacticMatches, 35 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=367, Invalid=3173, Unknown=0, NotChecked=0, Total=3540 [2022-02-15 01:36:21,362 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:21,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 705 Unchecked, 0.0s Time] [2022-02-15 01:36:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-15 01:36:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-15 01:36:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-02-15 01:36:21,399 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 95 [2022-02-15 01:36:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:21,399 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-02-15 01:36:21,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-02-15 01:36:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-15 01:36:21,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:21,399 INFO L514 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 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-02-15 01:36:21,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 01:36:21,400 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1975130562, now seen corresponding path program 34 times [2022-02-15 01:36:21,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:21,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531259837] [2022-02-15 01:36:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:21,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:21,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:21,467 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:21,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:21,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:21,512 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:21,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:24,055 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:24,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531259837] [2022-02-15 01:36:24,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1531259837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:24,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:24,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-02-15 01:36:24,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439649809] [2022-02-15 01:36:24,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:24,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-15 01:36:24,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-15 01:36:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 01:36:24,057 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 48 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:24,438 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2022-02-15 01:36:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-15 01:36:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-02-15 01:36:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:24,439 INFO L225 Difference]: With dead ends: 103 [2022-02-15 01:36:24,439 INFO L226 Difference]: Without dead ends: 100 [2022-02-15 01:36:24,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 36 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=370, Invalid=3290, Unknown=0, NotChecked=0, Total=3660 [2022-02-15 01:36:24,440 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:24,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 282 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 75 Invalid, 0 Unknown, 719 Unchecked, 0.1s Time] [2022-02-15 01:36:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-15 01:36:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-02-15 01:36:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-02-15 01:36:24,481 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 97 [2022-02-15 01:36:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:24,481 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-02-15 01:36:24,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-02-15 01:36:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-15 01:36:24,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:24,482 INFO L514 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 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-02-15 01:36:24,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 01:36:24,482 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:24,482 INFO L85 PathProgramCache]: Analyzing trace with hash 267536568, now seen corresponding path program 35 times [2022-02-15 01:36:24,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:24,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [327325270] [2022-02-15 01:36:24,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:24,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:24,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:24,530 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:24,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:24,581 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:24,581 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:27,302 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:27,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [327325270] [2022-02-15 01:36:27,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [327325270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:27,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:27,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-02-15 01:36:27,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550349574] [2022-02-15 01:36:27,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:27,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-15 01:36:27,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:27,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-15 01:36:27,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2438, Unknown=0, NotChecked=0, Total=2652 [2022-02-15 01:36:27,309 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:27,708 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-02-15 01:36:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-15 01:36:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-02-15 01:36:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:27,709 INFO L225 Difference]: With dead ends: 105 [2022-02-15 01:36:27,709 INFO L226 Difference]: Without dead ends: 102 [2022-02-15 01:36:27,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 5 SyntacticMatches, 37 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=373, Invalid=3409, Unknown=0, NotChecked=0, Total=3782 [2022-02-15 01:36:27,715 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:27,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 282 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 739 Unchecked, 0.0s Time] [2022-02-15 01:36:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-15 01:36:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-15 01:36:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-02-15 01:36:27,756 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2022-02-15 01:36:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:27,756 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-02-15 01:36:27,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-02-15 01:36:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-15 01:36:27,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:27,757 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 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-02-15 01:36:27,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-15 01:36:27,757 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash -602934094, now seen corresponding path program 36 times [2022-02-15 01:36:27,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:27,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344051083] [2022-02-15 01:36:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:27,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:27,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:27,830 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:27,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:27,900 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:27,900 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:28,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:30,577 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:30,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344051083] [2022-02-15 01:36:30,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [344051083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:30,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:30,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-02-15 01:36:30,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346515269] [2022-02-15 01:36:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:30,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-15 01:36:30,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-15 01:36:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2539, Unknown=0, NotChecked=0, Total=2756 [2022-02-15 01:36:30,578 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 50 states, 50 states have (on average 1.94) internal successors, (97), 49 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:30,966 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-02-15 01:36:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-15 01:36:30,967 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.94) internal successors, (97), 49 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-02-15 01:36:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:30,967 INFO L225 Difference]: With dead ends: 107 [2022-02-15 01:36:30,967 INFO L226 Difference]: Without dead ends: 104 [2022-02-15 01:36:30,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 5 SyntacticMatches, 38 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=376, Invalid=3530, Unknown=0, NotChecked=0, Total=3906 [2022-02-15 01:36:30,968 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 760 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:30,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 282 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 95 Invalid, 0 Unknown, 760 Unchecked, 0.0s Time] [2022-02-15 01:36:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-15 01:36:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-15 01:36:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-02-15 01:36:31,015 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2022-02-15 01:36:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:31,015 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-02-15 01:36:31,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.94) internal successors, (97), 49 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-15 01:36:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-15 01:36:31,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:31,016 INFO L514 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 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-02-15 01:36:31,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-15 01:36:31,016 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 393382444, now seen corresponding path program 37 times [2022-02-15 01:36:31,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:31,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254182781] [2022-02-15 01:36:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:31,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:31,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:31,082 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:31,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:31,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:31,130 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:33,961 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:33,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254182781] [2022-02-15 01:36:33,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1254182781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:33,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:33,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-02-15 01:36:33,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187445365] [2022-02-15 01:36:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:33,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-15 01:36:33,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:33,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-15 01:36:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2642, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 01:36:33,963 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:34,355 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-02-15 01:36:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-15 01:36:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-02-15 01:36:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:34,356 INFO L225 Difference]: With dead ends: 109 [2022-02-15 01:36:34,356 INFO L226 Difference]: Without dead ends: 106 [2022-02-15 01:36:34,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 8 SyntacticMatches, 39 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=379, Invalid=3653, Unknown=0, NotChecked=0, Total=4032 [2022-02-15 01:36:34,356 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 784 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:34,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 289 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 70 Invalid, 0 Unknown, 784 Unchecked, 0.0s Time] [2022-02-15 01:36:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-15 01:36:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-15 01:36:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-02-15 01:36:34,406 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 103 [2022-02-15 01:36:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:34,407 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-02-15 01:36:34,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-02-15 01:36:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 01:36:34,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:34,407 INFO L514 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 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-02-15 01:36:34,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-15 01:36:34,408 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 75868454, now seen corresponding path program 38 times [2022-02-15 01:36:34,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:34,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312037738] [2022-02-15 01:36:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:34,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:34,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:34,459 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:34,475 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:34,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:34,519 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:34,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:37,506 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:37,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312037738] [2022-02-15 01:36:37,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [312037738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:37,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:37,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-02-15 01:36:37,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008081082] [2022-02-15 01:36:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:37,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-02-15 01:36:37,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-02-15 01:36:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2747, Unknown=0, NotChecked=0, Total=2970 [2022-02-15 01:36:37,507 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 52 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:37,898 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2022-02-15 01:36:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-02-15 01:36:37,899 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-02-15 01:36:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:37,899 INFO L225 Difference]: With dead ends: 111 [2022-02-15 01:36:37,899 INFO L226 Difference]: Without dead ends: 108 [2022-02-15 01:36:37,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 11 SyntacticMatches, 40 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=382, Invalid=3778, Unknown=0, NotChecked=0, Total=4160 [2022-02-15 01:36:37,900 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 808 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:37,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 296 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 808 Unchecked, 0.0s Time] [2022-02-15 01:36:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-15 01:36:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-02-15 01:36:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-02-15 01:36:37,947 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2022-02-15 01:36:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:37,948 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-02-15 01:36:37,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-02-15 01:36:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-15 01:36:37,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:37,948 INFO L514 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 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-02-15 01:36:37,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-15 01:36:37,948 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -112397920, now seen corresponding path program 39 times [2022-02-15 01:36:37,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:37,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981026690] [2022-02-15 01:36:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:37,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:38,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:38,000 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:38,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:38,049 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:38,049 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:41,095 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:41,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981026690] [2022-02-15 01:36:41,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [981026690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:41,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:41,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-02-15 01:36:41,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761024002] [2022-02-15 01:36:41,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:41,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-02-15 01:36:41,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:41,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-02-15 01:36:41,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2854, Unknown=0, NotChecked=0, Total=3080 [2022-02-15 01:36:41,096 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 53 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 states have internal predecessors, (103), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:41,529 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-02-15 01:36:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-15 01:36:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 states have internal predecessors, (103), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-02-15 01:36:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:41,530 INFO L225 Difference]: With dead ends: 113 [2022-02-15 01:36:41,530 INFO L226 Difference]: Without dead ends: 110 [2022-02-15 01:36:41,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 5 SyntacticMatches, 41 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=385, Invalid=3905, Unknown=0, NotChecked=0, Total=4290 [2022-02-15 01:36:41,531 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 823 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:41,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 317 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 823 Unchecked, 0.0s Time] [2022-02-15 01:36:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-15 01:36:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-15 01:36:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-02-15 01:36:41,581 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2022-02-15 01:36:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:41,581 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-02-15 01:36:41,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 states have internal predecessors, (103), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-02-15 01:36:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-15 01:36:41,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:41,582 INFO L514 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 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-02-15 01:36:41,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-15 01:36:41,582 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash -647756902, now seen corresponding path program 40 times [2022-02-15 01:36:41,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:41,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600104918] [2022-02-15 01:36:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:41,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:41,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:41,647 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:41,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:41,699 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:41,699 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:44,882 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:44,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600104918] [2022-02-15 01:36:44,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1600104918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:44,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:44,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-02-15 01:36:44,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356351787] [2022-02-15 01:36:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:44,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-15 01:36:44,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-15 01:36:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2963, Unknown=0, NotChecked=0, Total=3192 [2022-02-15 01:36:44,884 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 54 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:45,318 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2022-02-15 01:36:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-02-15 01:36:45,319 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-02-15 01:36:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:45,319 INFO L225 Difference]: With dead ends: 115 [2022-02-15 01:36:45,319 INFO L226 Difference]: Without dead ends: 112 [2022-02-15 01:36:45,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 42 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=388, Invalid=4034, Unknown=0, NotChecked=0, Total=4422 [2022-02-15 01:36:45,320 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 844 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:45,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 317 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 67 Invalid, 0 Unknown, 844 Unchecked, 0.0s Time] [2022-02-15 01:36:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-15 01:36:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-02-15 01:36:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-02-15 01:36:45,375 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2022-02-15 01:36:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:45,375 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-02-15 01:36:45,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-02-15 01:36:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-15 01:36:45,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:45,376 INFO L514 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 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-02-15 01:36:45,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-15 01:36:45,376 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 268336916, now seen corresponding path program 41 times [2022-02-15 01:36:45,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:45,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1386449134] [2022-02-15 01:36:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:45,616 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:45,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:45,634 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:45,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:45,712 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:45,712 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:48,965 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:48,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1386449134] [2022-02-15 01:36:48,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1386449134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:48,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:48,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-02-15 01:36:48,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915689506] [2022-02-15 01:36:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:48,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-02-15 01:36:48,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-02-15 01:36:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3074, Unknown=0, NotChecked=0, Total=3306 [2022-02-15 01:36:48,966 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 55 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:49,386 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-02-15 01:36:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-15 01:36:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-02-15 01:36:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:49,387 INFO L225 Difference]: With dead ends: 117 [2022-02-15 01:36:49,387 INFO L226 Difference]: Without dead ends: 114 [2022-02-15 01:36:49,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 5 SyntacticMatches, 43 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=391, Invalid=4165, Unknown=0, NotChecked=0, Total=4556 [2022-02-15 01:36:49,388 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 865 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:49,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 331 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 68 Invalid, 0 Unknown, 865 Unchecked, 0.0s Time] [2022-02-15 01:36:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-15 01:36:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-02-15 01:36:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2022-02-15 01:36:49,443 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2022-02-15 01:36:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:49,443 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2022-02-15 01:36:49,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-02-15 01:36:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-15 01:36:49,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:49,444 INFO L514 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 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-02-15 01:36:49,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-15 01:36:49,444 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 166200334, now seen corresponding path program 42 times [2022-02-15 01:36:49,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:49,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427944467] [2022-02-15 01:36:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:49,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:49,513 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:49,513 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:49,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:49,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:49,570 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:53,030 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:53,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427944467] [2022-02-15 01:36:53,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [427944467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:53,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:53,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-02-15 01:36:53,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551741021] [2022-02-15 01:36:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:53,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-02-15 01:36:53,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-02-15 01:36:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=3187, Unknown=0, NotChecked=0, Total=3422 [2022-02-15 01:36:53,032 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand has 56 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:53,470 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2022-02-15 01:36:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-02-15 01:36:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-02-15 01:36:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:53,471 INFO L225 Difference]: With dead ends: 119 [2022-02-15 01:36:53,471 INFO L226 Difference]: Without dead ends: 116 [2022-02-15 01:36:53,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 6 SyntacticMatches, 44 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=394, Invalid=4298, Unknown=0, NotChecked=0, Total=4692 [2022-02-15 01:36:53,471 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:53,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 324 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 70 Invalid, 0 Unknown, 887 Unchecked, 0.0s Time] [2022-02-15 01:36:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-15 01:36:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-15 01:36:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2022-02-15 01:36:53,542 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 113 [2022-02-15 01:36:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:53,543 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2022-02-15 01:36:53,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2022-02-15 01:36:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-15 01:36:53,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:53,543 INFO L514 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 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-02-15 01:36:53,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-15 01:36:53,543 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 797192840, now seen corresponding path program 43 times [2022-02-15 01:36:53,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:53,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [934652521] [2022-02-15 01:36:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:53,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:53,608 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:53,609 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:53,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:53,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:53,667 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:36:57,241 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:36:57,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [934652521] [2022-02-15 01:36:57,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [934652521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:36:57,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:36:57,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-02-15 01:36:57,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971216555] [2022-02-15 01:36:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:36:57,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-02-15 01:36:57,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:36:57,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-02-15 01:36:57,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3302, Unknown=0, NotChecked=0, Total=3540 [2022-02-15 01:36:57,243 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand has 57 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:36:57,691 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-02-15 01:36:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-02-15 01:36:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-02-15 01:36:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:36:57,691 INFO L225 Difference]: With dead ends: 121 [2022-02-15 01:36:57,691 INFO L226 Difference]: Without dead ends: 118 [2022-02-15 01:36:57,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 7 SyntacticMatches, 45 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=397, Invalid=4433, Unknown=0, NotChecked=0, Total=4830 [2022-02-15 01:36:57,692 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 909 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:36:57,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 338 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 0 Unknown, 909 Unchecked, 0.0s Time] [2022-02-15 01:36:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-15 01:36:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-15 01:36:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-02-15 01:36:57,751 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2022-02-15 01:36:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:36:57,752 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-02-15 01:36:57,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:36:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-02-15 01:36:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-15 01:36:57,752 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:36:57,752 INFO L514 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 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-02-15 01:36:57,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-15 01:36:57,752 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:36:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:36:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1590602370, now seen corresponding path program 44 times [2022-02-15 01:36:57,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:36:57,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426701344] [2022-02-15 01:36:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:36:57,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:57,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:57,806 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:57,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:57,857 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:36:57,857 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:36:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:36:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:58,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:36:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:36:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:01,616 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:01,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426701344] [2022-02-15 01:37:01,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [426701344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:01,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:01,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-02-15 01:37:01,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610148815] [2022-02-15 01:37:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:01,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-02-15 01:37:01,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:01,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-02-15 01:37:01,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3419, Unknown=0, NotChecked=0, Total=3660 [2022-02-15 01:37:01,618 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:02,084 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2022-02-15 01:37:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-15 01:37:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-02-15 01:37:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:02,085 INFO L225 Difference]: With dead ends: 123 [2022-02-15 01:37:02,085 INFO L226 Difference]: Without dead ends: 120 [2022-02-15 01:37:02,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 46 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=400, Invalid=4570, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 01:37:02,090 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 929 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:02,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 70 Invalid, 0 Unknown, 929 Unchecked, 0.0s Time] [2022-02-15 01:37:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-15 01:37:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-02-15 01:37:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2022-02-15 01:37:02,159 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2022-02-15 01:37:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:02,159 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2022-02-15 01:37:02,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-02-15 01:37:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-15 01:37:02,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:02,160 INFO L514 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 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-02-15 01:37:02,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-15 01:37:02,161 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash -447017988, now seen corresponding path program 45 times [2022-02-15 01:37:02,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:02,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1448574560] [2022-02-15 01:37:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:02,204 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:02,221 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:02,221 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:02,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:02,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:02,283 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:06,236 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:06,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1448574560] [2022-02-15 01:37:06,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1448574560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:06,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:06,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-02-15 01:37:06,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331924577] [2022-02-15 01:37:06,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:06,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-02-15 01:37:06,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-02-15 01:37:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3538, Unknown=0, NotChecked=0, Total=3782 [2022-02-15 01:37:06,238 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:06,707 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-02-15 01:37:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-15 01:37:06,707 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-02-15 01:37:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:06,708 INFO L225 Difference]: With dead ends: 125 [2022-02-15 01:37:06,708 INFO L226 Difference]: Without dead ends: 122 [2022-02-15 01:37:06,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 5 SyntacticMatches, 47 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=403, Invalid=4709, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 01:37:06,709 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 949 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:06,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 359 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 70 Invalid, 0 Unknown, 949 Unchecked, 0.0s Time] [2022-02-15 01:37:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-15 01:37:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-02-15 01:37:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2022-02-15 01:37:06,780 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 119 [2022-02-15 01:37:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:06,780 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2022-02-15 01:37:06,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2022-02-15 01:37:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-15 01:37:06,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:06,780 INFO L514 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 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-02-15 01:37:06,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-15 01:37:06,781 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -95095050, now seen corresponding path program 46 times [2022-02-15 01:37:06,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:06,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657221823] [2022-02-15 01:37:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:06,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:06,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:06,841 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:06,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:06,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:06,909 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:10,855 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:10,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657221823] [2022-02-15 01:37:10,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1657221823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:10,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:10,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-02-15 01:37:10,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402335019] [2022-02-15 01:37:10,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:10,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-02-15 01:37:10,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:10,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-02-15 01:37:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3659, Unknown=0, NotChecked=0, Total=3906 [2022-02-15 01:37:10,856 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand has 60 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:11,329 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2022-02-15 01:37:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-02-15 01:37:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-02-15 01:37:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:11,330 INFO L225 Difference]: With dead ends: 127 [2022-02-15 01:37:11,330 INFO L226 Difference]: Without dead ends: 124 [2022-02-15 01:37:11,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 48 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=406, Invalid=4850, Unknown=0, NotChecked=0, Total=5256 [2022-02-15 01:37:11,331 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 970 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:11,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 359 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 69 Invalid, 0 Unknown, 970 Unchecked, 0.0s Time] [2022-02-15 01:37:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-15 01:37:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-02-15 01:37:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2022-02-15 01:37:11,400 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 121 [2022-02-15 01:37:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:11,400 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2022-02-15 01:37:11,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2022-02-15 01:37:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-15 01:37:11,401 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:11,401 INFO L514 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 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-02-15 01:37:11,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-02-15 01:37:11,401 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1199568016, now seen corresponding path program 47 times [2022-02-15 01:37:11,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:11,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577736432] [2022-02-15 01:37:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:11,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:11,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:11,460 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:11,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:11,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:11,523 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:15,653 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:15,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577736432] [2022-02-15 01:37:15,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1577736432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:15,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:15,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-02-15 01:37:15,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486662154] [2022-02-15 01:37:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:15,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-02-15 01:37:15,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-02-15 01:37:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3782, Unknown=0, NotChecked=0, Total=4032 [2022-02-15 01:37:15,655 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:16,122 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-02-15 01:37:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-15 01:37:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-02-15 01:37:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:16,123 INFO L225 Difference]: With dead ends: 129 [2022-02-15 01:37:16,123 INFO L226 Difference]: Without dead ends: 126 [2022-02-15 01:37:16,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 13 SyntacticMatches, 49 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=409, Invalid=4993, Unknown=0, NotChecked=0, Total=5402 [2022-02-15 01:37:16,123 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 999 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:16,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 352 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 999 Unchecked, 0.0s Time] [2022-02-15 01:37:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-15 01:37:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-02-15 01:37:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2022-02-15 01:37:16,197 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2022-02-15 01:37:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:16,197 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2022-02-15 01:37:16,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2022-02-15 01:37:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-15 01:37:16,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:16,197 INFO L514 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 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-02-15 01:37:16,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-02-15 01:37:16,198 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1741166230, now seen corresponding path program 48 times [2022-02-15 01:37:16,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:16,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531318447] [2022-02-15 01:37:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:16,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:16,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:16,262 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:16,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:16,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:16,311 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:20,578 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:20,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531318447] [2022-02-15 01:37:20,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [531318447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:20,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:20,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-02-15 01:37:20,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969867367] [2022-02-15 01:37:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:20,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-02-15 01:37:20,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-02-15 01:37:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3907, Unknown=0, NotChecked=0, Total=4160 [2022-02-15 01:37:20,579 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand has 62 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:21,088 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2022-02-15 01:37:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-02-15 01:37:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-02-15 01:37:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:21,089 INFO L225 Difference]: With dead ends: 131 [2022-02-15 01:37:21,089 INFO L226 Difference]: Without dead ends: 128 [2022-02-15 01:37:21,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 5 SyntacticMatches, 50 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=412, Invalid=5138, Unknown=0, NotChecked=0, Total=5550 [2022-02-15 01:37:21,090 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1012 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:21,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 366 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 89 Invalid, 0 Unknown, 1012 Unchecked, 0.0s Time] [2022-02-15 01:37:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-15 01:37:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-02-15 01:37:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2022-02-15 01:37:21,171 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2022-02-15 01:37:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:21,172 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2022-02-15 01:37:21,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 states have internal predecessors, (121), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-02-15 01:37:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-02-15 01:37:21,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:21,172 INFO L514 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 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-02-15 01:37:21,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-02-15 01:37:21,172 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1768960228, now seen corresponding path program 49 times [2022-02-15 01:37:21,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:21,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109746501] [2022-02-15 01:37:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:21,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:21,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:21,237 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:21,252 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:21,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:21,283 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:25,686 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:25,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109746501] [2022-02-15 01:37:25,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1109746501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:25,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:25,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-02-15 01:37:25,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720781088] [2022-02-15 01:37:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:25,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-02-15 01:37:25,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:25,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-02-15 01:37:25,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4034, Unknown=0, NotChecked=0, Total=4290 [2022-02-15 01:37:25,688 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 63 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:26,183 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-02-15 01:37:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-02-15 01:37:26,183 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-02-15 01:37:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:26,184 INFO L225 Difference]: With dead ends: 133 [2022-02-15 01:37:26,184 INFO L226 Difference]: Without dead ends: 130 [2022-02-15 01:37:26,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 13 SyntacticMatches, 51 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=415, Invalid=5285, Unknown=0, NotChecked=0, Total=5700 [2022-02-15 01:37:26,185 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1041 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:26,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 366 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 1041 Unchecked, 0.0s Time] [2022-02-15 01:37:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-15 01:37:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-02-15 01:37:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2022-02-15 01:37:26,265 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 127 [2022-02-15 01:37:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:26,266 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2022-02-15 01:37:26,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-02-15 01:37:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-15 01:37:26,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:26,266 INFO L514 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 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-02-15 01:37:26,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-02-15 01:37:26,266 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:26,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash -843808290, now seen corresponding path program 50 times [2022-02-15 01:37:26,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:26,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534511269] [2022-02-15 01:37:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:26,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:26,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:26,319 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:26,343 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:26,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:26,385 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:30,965 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:30,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [534511269] [2022-02-15 01:37:30,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [534511269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:30,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:30,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-02-15 01:37:30,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393385376] [2022-02-15 01:37:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:30,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-02-15 01:37:30,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-02-15 01:37:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4163, Unknown=0, NotChecked=0, Total=4422 [2022-02-15 01:37:30,966 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 64 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:31,484 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2022-02-15 01:37:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 01:37:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-02-15 01:37:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:31,485 INFO L225 Difference]: With dead ends: 135 [2022-02-15 01:37:31,485 INFO L226 Difference]: Without dead ends: 132 [2022-02-15 01:37:31,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 5 SyntacticMatches, 52 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=418, Invalid=5434, Unknown=0, NotChecked=0, Total=5852 [2022-02-15 01:37:31,485 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1054 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:31,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 394 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 72 Invalid, 0 Unknown, 1054 Unchecked, 0.0s Time] [2022-02-15 01:37:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-15 01:37:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-02-15 01:37:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-02-15 01:37:31,565 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2022-02-15 01:37:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:31,566 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-02-15 01:37:31,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-02-15 01:37:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-02-15 01:37:31,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:37:31,566 INFO L514 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 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-02-15 01:37:31,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-02-15 01:37:31,567 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:37:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:37:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 841514072, now seen corresponding path program 51 times [2022-02-15 01:37:31,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:37:31,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108949833] [2022-02-15 01:37:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:37:31,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:31,621 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:31,621 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:31,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:31,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:37:31,682 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:37:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:37:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:37:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:37:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:37:36,234 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:37:36,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108949833] [2022-02-15 01:37:36,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2108949833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:37:36,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:37:36,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-02-15 01:37:36,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837447919] [2022-02-15 01:37:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:37:36,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-02-15 01:37:36,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:37:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-02-15 01:37:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4163, Unknown=0, NotChecked=0, Total=4422 [2022-02-15 01:37:36,235 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:37:36,757 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-02-15 01:37:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-02-15 01:37:36,757 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-02-15 01:37:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:37:36,757 INFO L225 Difference]: With dead ends: 132 [2022-02-15 01:37:36,757 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 01:37:36,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 7 SyntacticMatches, 52 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=418, Invalid=5434, Unknown=0, NotChecked=0, Total=5852 [2022-02-15 01:37:36,758 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1052 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:37:36,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 283 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 66 Invalid, 0 Unknown, 1052 Unchecked, 0.0s Time] [2022-02-15 01:37:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 01:37:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 01:37:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 01:37:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 01:37:36,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2022-02-15 01:37:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:37:36,760 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 01:37:36,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:37:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 01:37:36,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 01:37:36,762 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 01:37:36,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-02-15 01:37:36,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 01:37:49,435 WARN L228 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 10047 DAG size of output: 771 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:37:57,120 WARN L228 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 9684 DAG size of output: 758 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:37:57,136 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-02-15 01:37:57,136 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-02-15 01:37:57,136 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-02-15 01:37:57,136 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-02-15 01:37:57,137 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-15 01:37:57,143 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-15 01:37:57,143 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-15 01:37:57,143 INFO L854 garLoopResultBuilder]: At program point L31(lines 31 184) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L159(lines 43 160) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 5)) [2022-02-15 01:37:57,147 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 13 214) the Hoare annotation is: true [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L19(lines 19 208) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (= main_~main__x~0 0)) [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L147(lines 49 148) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 6)) [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L135(lines 55 136) the Hoare annotation is: (and (<= main_~main__x~0 7) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L94(lines 94 103) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_720~0)| ~__return_720~0) (<= 51 main_~main__x~0)) [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L61(lines 61 124) the Hoare annotation is: (and (<= main_~main__x~0 7) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,147 INFO L854 garLoopResultBuilder]: At program point L123(lines 61 124) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 8) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,148 INFO L854 garLoopResultBuilder]: At program point L49(lines 49 148) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 5)) [2022-02-15 01:37:57,148 INFO L854 garLoopResultBuilder]: At program point L111(lines 67 112) the Hoare annotation is: (let ((.cse0 (= |old(~__return_720~0)| ~__return_720~0))) (or (and (<= main_~main__y~0 88) .cse0 (<= 88 main_~main__y~0) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse1 (+ v_main_~main__x~0_1546 38))) (or (= .cse1 main_~main__x~0) (and (< .cse1 main_~main__x~0) (< main_~main__x~0 89)))) (<= v_main_~main__x~0_1546 9))) (<= 88 main_~main__x~0)) (and (<= main_~main__y~0 69) (<= 69 main_~main__y~0) .cse0 (<= 69 main_~main__x~0) (exists ((v_main_~main__x~0_1041 Int)) (and (let ((.cse2 (+ 19 v_main_~main__x~0_1041))) (or (= .cse2 main_~main__x~0) (and (< main_~main__x~0 70) (< .cse2 main_~main__x~0)))) (<= v_main_~main__x~0_1041 9)))) (and (<= 95 main_~main__y~0) .cse0 (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (exists ((v_main_~main__x~0_1897 Int)) (and (let ((.cse3 (+ v_main_~main__x~0_1897 45))) (or (and (< main_~main__x~0 96) (< .cse3 main_~main__x~0)) (= .cse3 main_~main__x~0))) (<= v_main_~main__x~0_1897 9)))) (and (<= main_~main__y~0 97) (<= 97 main_~main__y~0) .cse0 (<= 97 main_~main__x~0) (exists ((v_main_~main__x~0_1659 Int)) (and (let ((.cse4 (+ v_main_~main__x~0_1659 47))) (or (and (< .cse4 main_~main__x~0) (< main_~main__x~0 98)) (= .cse4 main_~main__x~0))) (<= v_main_~main__x~0_1659 9)))) (and (<= main_~main__y~0 67) (<= 67 main_~main__y~0) .cse0 (<= 67 main_~main__x~0) (exists ((v_main_~main__x~0_384 Int)) (and (<= v_main_~main__x~0_384 9) (let ((.cse5 (+ v_main_~main__x~0_384 17))) (or (and (< .cse5 main_~main__x~0) (< main_~main__x~0 68)) (= .cse5 main_~main__x~0)))))) (and (<= 75 main_~main__x~0) (<= main_~main__y~0 75) .cse0 (exists ((v_main_~main__x~0_826 Int)) (and (<= v_main_~main__x~0_826 9) (let ((.cse6 (+ v_main_~main__x~0_826 25))) (or (= .cse6 main_~main__x~0) (and (< .cse6 main_~main__x~0) (< main_~main__x~0 76)))))) (<= 75 main_~main__y~0)) (and (<= 96 main_~main__x~0) .cse0 (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (exists ((v_main_~main__x~0_1897 Int)) (and (<= v_main_~main__x~0_1897 9) (let ((.cse7 (+ v_main_~main__x~0_1897 46))) (or (and (< main_~main__x~0 97) (< .cse7 main_~main__x~0)) (= .cse7 main_~main__x~0)))))) (and (<= 83 main_~main__y~0) (<= main_~main__y~0 83) .cse0 (<= 83 main_~main__x~0) (exists ((v_main_~main__x~0_1182 Int)) (and (let ((.cse8 (+ v_main_~main__x~0_1182 33))) (or (= .cse8 main_~main__x~0) (and (< main_~main__x~0 84) (< .cse8 main_~main__x~0)))) (<= v_main_~main__x~0_1182 9)))) (and (<= 52 main_~main__y~0) (<= 52 main_~main__x~0) .cse0 (<= main_~main__y~0 52) (exists ((v_main_~main__x~0_84 Int)) (and (<= v_main_~main__x~0_84 9) (let ((.cse9 (+ 2 v_main_~main__x~0_84))) (or (= .cse9 main_~main__x~0) (and (< .cse9 main_~main__x~0) (< main_~main__x~0 53))))))) (and (<= main_~main__y~0 66) .cse0 (<= 66 main_~main__x~0) (<= 66 main_~main__y~0) (exists ((v_main_~main__x~0_441 Int)) (and (<= v_main_~main__x~0_441 9) (let ((.cse10 (+ 16 v_main_~main__x~0_441))) (or (and (< .cse10 main_~main__x~0) (< main_~main__x~0 67)) (= main_~main__x~0 .cse10)))))) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (exists ((v_main_~main__x~0_384 Int)) (and (<= v_main_~main__x~0_384 9) (let ((.cse11 (+ 3 v_main_~main__x~0_384))) (or (and (< .cse11 main_~main__x~0) (< main_~main__x~0 54)) (= .cse11 main_~main__x~0)))))) (and (<= main_~main__y~0 60) (<= 60 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_534 Int)) (and (let ((.cse12 (+ v_main_~main__x~0_534 10))) (or (and (< .cse12 main_~main__x~0) (< main_~main__x~0 61)) (= .cse12 main_~main__x~0))) (<= v_main_~main__x~0_534 9))) (<= 60 main_~main__x~0)) (and (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (exists ((v_main_~main__x~0_1332 Int)) (and (let ((.cse13 (+ v_main_~main__x~0_1332 14))) (or (= .cse13 main_~main__x~0) (and (< .cse13 main_~main__x~0) (< main_~main__x~0 65)))) (<= v_main_~main__x~0_1332 9))) (<= 64 main_~main__x~0)) (and (<= 92 main_~main__x~0) (<= 92 main_~main__y~0) .cse0 (<= main_~main__y~0 92) (exists ((v_main_~main__x~0_1776 Int)) (and (let ((.cse14 (+ v_main_~main__x~0_1776 42))) (or (and (< .cse14 main_~main__x~0) (< main_~main__x~0 93)) (= .cse14 main_~main__x~0))) (<= v_main_~main__x~0_1776 9)))) (and (<= 91 main_~main__y~0) (<= 91 main_~main__x~0) .cse0 (exists ((v_main_~main__x~0_1332 Int)) (and (let ((.cse15 (+ 41 v_main_~main__x~0_1332))) (or (and (< main_~main__x~0 92) (< .cse15 main_~main__x~0)) (= .cse15 main_~main__x~0))) (<= v_main_~main__x~0_1332 9))) (<= main_~main__y~0 91)) (and (<= 100 main_~main__x~0) (exists ((v_main_~main__x~0_1836 Int)) (and (<= v_main_~main__x~0_1836 9) (let ((.cse16 (+ v_main_~main__x~0_1836 50))) (or (= main_~main__x~0 .cse16) (and (< main_~main__x~0 101) (< .cse16 main_~main__x~0)))))) .cse0 (<= 100 main_~main__y~0) (<= main_~main__y~0 100)) (and (<= main_~main__y~0 84) (<= 84 main_~main__x~0) (<= 84 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_1087 Int)) (and (let ((.cse17 (+ v_main_~main__x~0_1087 34))) (or (= .cse17 main_~main__x~0) (and (< .cse17 main_~main__x~0) (< main_~main__x~0 85)))) (<= v_main_~main__x~0_1087 9)))) (and (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_786 Int)) (and (<= v_main_~main__x~0_786 9) (let ((.cse18 (+ v_main_~main__x~0_786 28))) (or (and (< main_~main__x~0 79) (< .cse18 main_~main__x~0)) (= .cse18 main_~main__x~0)))))) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_357 Int)) (and (or (= v_main_~main__x~0_357 main_~main__x~0) (and (< v_main_~main__x~0_357 main_~main__x~0) (< main_~main__x~0 51))) (<= v_main_~main__x~0_357 9)))) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= 98 main_~main__x~0) .cse0 (exists ((v_main_~main__x~0_1897 Int)) (and (<= v_main_~main__x~0_1897 9) (let ((.cse19 (+ v_main_~main__x~0_1897 48))) (or (= .cse19 main_~main__x~0) (and (< .cse19 main_~main__x~0) (< main_~main__x~0 99))))))) (and (<= 65 main_~main__x~0) (<= 65 main_~main__y~0) .cse0 (<= main_~main__y~0 65) (exists ((v_main_~main__x~0_1602 Int)) (and (<= v_main_~main__x~0_1602 9) (let ((.cse20 (+ v_main_~main__x~0_1602 15))) (or (and (< .cse20 main_~main__x~0) (< main_~main__x~0 66)) (= .cse20 main_~main__x~0)))))) (and .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (exists ((v_main_~main__x~0_996 Int)) (and (let ((.cse21 (+ v_main_~main__x~0_996 4))) (or (and (< .cse21 main_~main__x~0) (< main_~main__x~0 55)) (= .cse21 main_~main__x~0))) (<= v_main_~main__x~0_996 9))) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 62) .cse0 (<= 62 main_~main__x~0) (<= 62 main_~main__y~0) (exists ((v_main_~main__x~0_709 Int)) (and (let ((.cse22 (+ v_main_~main__x~0_709 12))) (or (= .cse22 main_~main__x~0) (and (< main_~main__x~0 63) (< .cse22 main_~main__x~0)))) (<= v_main_~main__x~0_709 9)))) (and (<= main_~main__y~0 58) .cse0 (<= 58 main_~main__y~0) (<= 58 main_~main__x~0) (exists ((v_main_~main__x~0_534 Int)) (and (<= v_main_~main__x~0_534 9) (let ((.cse23 (+ v_main_~main__x~0_534 8))) (or (= .cse23 main_~main__x~0) (and (< main_~main__x~0 59) (< .cse23 main_~main__x~0))))))) (and (<= main_~main__y~0 51) .cse0 (<= 51 main_~main__y~0) (exists ((v_main_~main__x~0_1717 Int)) (and (<= v_main_~main__x~0_1717 9) (let ((.cse24 (+ v_main_~main__x~0_1717 1))) (or (= .cse24 main_~main__x~0) (and (< .cse24 main_~main__x~0) (< main_~main__x~0 52)))))) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 90) .cse0 (<= 90 main_~main__x~0) (exists ((v_main_~main__x~0_1491 Int)) (and (<= v_main_~main__x~0_1491 9) (let ((.cse25 (+ 40 v_main_~main__x~0_1491))) (or (and (< .cse25 main_~main__x~0) (< main_~main__x~0 91)) (= .cse25 main_~main__x~0))))) (<= 90 main_~main__y~0)) (and (<= 76 main_~main__x~0) .cse0 (<= main_~main__y~0 76) (<= 76 main_~main__y~0) (exists ((v_main_~main__x~0_1897 Int)) (and (let ((.cse26 (+ v_main_~main__x~0_1897 26))) (or (= .cse26 main_~main__x~0) (and (< .cse26 main_~main__x~0) (< main_~main__x~0 77)))) (<= v_main_~main__x~0_1897 9)))) (and (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= 61 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_672 Int)) (and (<= v_main_~main__x~0_672 9) (let ((.cse27 (+ v_main_~main__x~0_672 11))) (or (and (< .cse27 main_~main__x~0) (< main_~main__x~0 62)) (= .cse27 main_~main__x~0)))))) (and (<= main_~main__y~0 99) (exists ((v_main_~main__x~0_1776 Int)) (and (let ((.cse28 (+ 49 v_main_~main__x~0_1776))) (or (= .cse28 main_~main__x~0) (and (< main_~main__x~0 100) (< .cse28 main_~main__x~0)))) (<= v_main_~main__x~0_1776 9))) (<= 99 main_~main__y~0) .cse0 (<= 99 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) .cse0 (<= 57 main_~main__y~0) (exists ((v_main_~main__x~0_1041 Int)) (and (let ((.cse29 (+ 7 v_main_~main__x~0_1041))) (or (and (< .cse29 main_~main__x~0) (< main_~main__x~0 58)) (= .cse29 main_~main__x~0))) (<= v_main_~main__x~0_1041 9)))) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (exists ((v_main_~main__x~0_441 Int)) (and (<= v_main_~main__x~0_441 9) (let ((.cse30 (+ 5 v_main_~main__x~0_441))) (or (and (< main_~main__x~0 56) (< .cse30 main_~main__x~0)) (= .cse30 main_~main__x~0)))))) (and .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56) (exists ((v_main_~main__x~0_282 Int)) (and (let ((.cse31 (+ 6 v_main_~main__x~0_282))) (or (= .cse31 main_~main__x~0) (and (< .cse31 main_~main__x~0) (< main_~main__x~0 57)))) (<= v_main_~main__x~0_282 9)))) (and (<= 70 main_~main__y~0) (<= 70 main_~main__x~0) (<= main_~main__y~0 70) .cse0 (exists ((v_main_~main__x~0_1491 Int)) (and (<= v_main_~main__x~0_1491 9) (let ((.cse32 (+ v_main_~main__x~0_1491 20))) (or (and (< .cse32 main_~main__x~0) (< main_~main__x~0 71)) (= .cse32 main_~main__x~0)))))) (and (<= main_~main__y~0 72) (<= 72 main_~main__x~0) (<= 72 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_952 Int)) (and (let ((.cse33 (+ 22 v_main_~main__x~0_952))) (or (and (< main_~main__x~0 73) (< .cse33 main_~main__x~0)) (= .cse33 main_~main__x~0))) (<= v_main_~main__x~0_952 9)))) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) .cse0 (<= 89 main_~main__x~0) (exists ((v_main_~main__x~0_1231 Int)) (and (let ((.cse34 (+ v_main_~main__x~0_1231 39))) (or (and (< .cse34 main_~main__x~0) (< main_~main__x~0 90)) (= main_~main__x~0 .cse34))) (<= v_main_~main__x~0_1231 9)))) (and (<= 82 main_~main__x~0) .cse0 (<= 82 main_~main__y~0) (<= main_~main__y~0 82) (exists ((v_main_~main__x~0_1717 Int)) (and (<= v_main_~main__x~0_1717 9) (let ((.cse35 (+ 32 v_main_~main__x~0_1717))) (or (and (< .cse35 main_~main__x~0) (< main_~main__x~0 83)) (= .cse35 main_~main__x~0)))))) (and (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59) (exists ((v_main_~main__x~0_1776 Int)) (and (let ((.cse36 (+ v_main_~main__x~0_1776 9))) (or (and (< .cse36 main_~main__x~0) (< main_~main__x~0 60)) (= .cse36 main_~main__x~0))) (<= v_main_~main__x~0_1776 9)))) (and (<= main_~main__y~0 85) (<= 85 main_~main__x~0) .cse0 (<= 85 main_~main__y~0) (exists ((v_main_~main__x~0_1602 Int)) (and (<= v_main_~main__x~0_1602 9) (let ((.cse37 (+ 35 v_main_~main__x~0_1602))) (or (and (< main_~main__x~0 86) (< .cse37 main_~main__x~0)) (= .cse37 main_~main__x~0)))))) (and (<= 77 main_~main__x~0) (<= main_~main__y~0 77) .cse0 (<= 77 main_~main__y~0) (exists ((v_main_~main__x~0_747 Int)) (and (<= v_main_~main__x~0_747 9) (let ((.cse38 (+ v_main_~main__x~0_747 27))) (or (= .cse38 main_~main__x~0) (and (< .cse38 main_~main__x~0) (< main_~main__x~0 78))))))) (and (<= main_~main__y~0 68) (<= 68 main_~main__y~0) (<= 68 main_~main__x~0) .cse0 (exists ((v_main_~main__x~0_1182 Int)) (and (<= v_main_~main__x~0_1182 9) (let ((.cse39 (+ v_main_~main__x~0_1182 18))) (or (= .cse39 main_~main__x~0) (and (< main_~main__x~0 69) (< .cse39 main_~main__x~0))))))) (and (<= 73 main_~main__y~0) .cse0 (<= main_~main__y~0 73) (<= 73 main_~main__x~0) (exists ((v_main_~main__x~0_1546 Int)) (and (<= v_main_~main__x~0_1546 9) (let ((.cse40 (+ 23 v_main_~main__x~0_1546))) (or (and (< main_~main__x~0 74) (< .cse40 main_~main__x~0)) (= main_~main__x~0 .cse40)))))) (and (<= 87 main_~main__x~0) (<= 87 main_~main__y~0) (<= main_~main__y~0 87) .cse0 (exists ((v_main_~main__x~0_1134 Int)) (and (<= v_main_~main__x~0_1134 9) (let ((.cse41 (+ v_main_~main__x~0_1134 37))) (or (= .cse41 main_~main__x~0) (and (< .cse41 main_~main__x~0) (< main_~main__x~0 88))))))) (and (<= main_~main__y~0 79) .cse0 (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (exists ((v_main_~main__x~0_1134 Int)) (and (<= v_main_~main__x~0_1134 9) (let ((.cse42 (+ 29 v_main_~main__x~0_1134))) (or (and (< main_~main__x~0 80) (< .cse42 main_~main__x~0)) (= .cse42 main_~main__x~0)))))) (and (<= 81 main_~main__x~0) (<= main_~main__y~0 81) (<= 81 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_1041 Int)) (and (<= v_main_~main__x~0_1041 9) (let ((.cse43 (+ v_main_~main__x~0_1041 31))) (or (= .cse43 main_~main__x~0) (and (< .cse43 main_~main__x~0) (< main_~main__x~0 82))))))) (and (<= 94 main_~main__y~0) (<= main_~main__y~0 94) .cse0 (<= 94 main_~main__x~0) (exists ((v_main_~main__x~0_1659 Int)) (and (let ((.cse44 (+ 44 v_main_~main__x~0_1659))) (or (and (< main_~main__x~0 95) (< .cse44 main_~main__x~0)) (= main_~main__x~0 .cse44))) (<= v_main_~main__x~0_1659 9)))) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__y~0 63) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse45 (+ v_main_~main__x~0_1546 13))) (or (= .cse45 main_~main__x~0) (and (< main_~main__x~0 64) (< .cse45 main_~main__x~0)))) (<= v_main_~main__x~0_1546 9)))) (and (<= 80 main_~main__y~0) .cse0 (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (exists ((v_main_~main__x~0_826 Int)) (and (<= v_main_~main__x~0_826 9) (let ((.cse46 (+ 30 v_main_~main__x~0_826))) (or (= .cse46 main_~main__x~0) (and (< main_~main__x~0 81) (< .cse46 main_~main__x~0))))))) (and (<= 71 main_~main__y~0) (<= main_~main__y~0 71) .cse0 (<= 71 main_~main__x~0) (exists ((v_main_~main__x~0_1087 Int)) (and (let ((.cse47 (+ v_main_~main__x~0_1087 21))) (or (and (< .cse47 main_~main__x~0) (< main_~main__x~0 72)) (= .cse47 main_~main__x~0))) (<= v_main_~main__x~0_1087 9)))) (and (<= 86 main_~main__x~0) (<= 86 main_~main__y~0) .cse0 (<= main_~main__y~0 86) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse48 (+ v_main_~main__x~0_1546 36))) (or (and (< .cse48 main_~main__x~0) (< main_~main__x~0 87)) (= .cse48 main_~main__x~0))) (<= v_main_~main__x~0_1546 9)))) (and (<= 74 main_~main__y~0) (<= 74 main_~main__x~0) .cse0 (<= main_~main__y~0 74) (exists ((v_main_~main__x~0_1182 Int)) (and (let ((.cse49 (+ v_main_~main__x~0_1182 24))) (or (= .cse49 main_~main__x~0) (and (< main_~main__x~0 75) (< .cse49 main_~main__x~0)))) (<= v_main_~main__x~0_1182 9)))) (and (<= 93 main_~main__y~0) .cse0 (<= 93 main_~main__x~0) (<= main_~main__y~0 93) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse50 (+ v_main_~main__x~0_1546 43))) (or (and (< main_~main__x~0 94) (< .cse50 main_~main__x~0)) (= .cse50 main_~main__x~0))) (<= v_main_~main__x~0_1546 9)))))) [2022-02-15 01:37:57,149 INFO L854 garLoopResultBuilder]: At program point L74(lines 74 85) the Hoare annotation is: (let ((.cse0 (= |old(~__return_720~0)| ~__return_720~0))) (or (and (<= main_~main__y~0 88) .cse0 (<= 88 main_~main__y~0) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse1 (+ v_main_~main__x~0_1546 38))) (or (= .cse1 main_~main__x~0) (and (< .cse1 main_~main__x~0) (< main_~main__x~0 89)))) (<= v_main_~main__x~0_1546 9))) (<= 88 main_~main__x~0)) (and (<= main_~main__y~0 69) (<= 69 main_~main__y~0) .cse0 (<= 69 main_~main__x~0) (exists ((v_main_~main__x~0_1041 Int)) (and (let ((.cse2 (+ 19 v_main_~main__x~0_1041))) (or (= .cse2 main_~main__x~0) (and (< main_~main__x~0 70) (< .cse2 main_~main__x~0)))) (<= v_main_~main__x~0_1041 9)))) (and (<= 95 main_~main__y~0) .cse0 (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (exists ((v_main_~main__x~0_1897 Int)) (and (let ((.cse3 (+ v_main_~main__x~0_1897 45))) (or (and (< main_~main__x~0 96) (< .cse3 main_~main__x~0)) (= .cse3 main_~main__x~0))) (<= v_main_~main__x~0_1897 9)))) (and (<= 75 main_~main__x~0) (<= main_~main__y~0 75) .cse0 (exists ((v_main_~main__x~0_826 Int)) (and (<= v_main_~main__x~0_826 9) (let ((.cse4 (+ v_main_~main__x~0_826 25))) (or (= .cse4 main_~main__x~0) (and (< .cse4 main_~main__x~0) (< main_~main__x~0 76)))))) (<= 75 main_~main__y~0)) (and (<= 96 main_~main__x~0) .cse0 (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (exists ((v_main_~main__x~0_1897 Int)) (and (<= v_main_~main__x~0_1897 9) (let ((.cse5 (+ v_main_~main__x~0_1897 46))) (or (and (< main_~main__x~0 97) (< .cse5 main_~main__x~0)) (= .cse5 main_~main__x~0)))))) (and (<= 83 main_~main__y~0) (<= main_~main__y~0 83) .cse0 (<= 83 main_~main__x~0) (exists ((v_main_~main__x~0_1182 Int)) (and (let ((.cse6 (+ v_main_~main__x~0_1182 33))) (or (= .cse6 main_~main__x~0) (and (< main_~main__x~0 84) (< .cse6 main_~main__x~0)))) (<= v_main_~main__x~0_1182 9)))) (and (<= main_~main__y~0 66) .cse0 (<= 66 main_~main__x~0) (<= 66 main_~main__y~0) (exists ((v_main_~main__x~0_441 Int)) (and (<= v_main_~main__x~0_441 9) (let ((.cse7 (+ 16 v_main_~main__x~0_441))) (or (and (< .cse7 main_~main__x~0) (< main_~main__x~0 67)) (= main_~main__x~0 .cse7)))))) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (exists ((v_main_~main__x~0_384 Int)) (and (<= v_main_~main__x~0_384 9) (let ((.cse8 (+ 3 v_main_~main__x~0_384))) (or (and (< .cse8 main_~main__x~0) (< main_~main__x~0 54)) (= .cse8 main_~main__x~0)))))) (and (<= main_~main__y~0 60) (<= 60 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_534 Int)) (and (let ((.cse9 (+ v_main_~main__x~0_534 10))) (or (and (< .cse9 main_~main__x~0) (< main_~main__x~0 61)) (= .cse9 main_~main__x~0))) (<= v_main_~main__x~0_534 9))) (<= 60 main_~main__x~0)) (and (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (exists ((v_main_~main__x~0_1332 Int)) (and (let ((.cse10 (+ v_main_~main__x~0_1332 14))) (or (= .cse10 main_~main__x~0) (and (< .cse10 main_~main__x~0) (< main_~main__x~0 65)))) (<= v_main_~main__x~0_1332 9))) (<= 64 main_~main__x~0)) (and (<= 92 main_~main__x~0) (<= 92 main_~main__y~0) .cse0 (<= main_~main__y~0 92) (exists ((v_main_~main__x~0_1776 Int)) (and (let ((.cse11 (+ v_main_~main__x~0_1776 42))) (or (and (< .cse11 main_~main__x~0) (< main_~main__x~0 93)) (= .cse11 main_~main__x~0))) (<= v_main_~main__x~0_1776 9)))) (and (exists ((v_main_~main__x~0_1836 Int)) (and (let ((.cse12 (+ 49 v_main_~main__x~0_1836))) (or (= .cse12 main_~main__x~0) (and (< main_~main__x~0 100) (< .cse12 main_~main__x~0)))) (<= v_main_~main__x~0_1836 9))) (<= main_~main__y~0 99) (<= 99 main_~main__y~0) .cse0 (<= 99 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__x~0) (<= 84 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_1087 Int)) (and (let ((.cse13 (+ v_main_~main__x~0_1087 34))) (or (= .cse13 main_~main__x~0) (and (< .cse13 main_~main__x~0) (< main_~main__x~0 85)))) (<= v_main_~main__x~0_1087 9)))) (and (<= 91 main_~main__y~0) (<= 91 main_~main__x~0) .cse0 (exists ((v_main_~main__x~0_1659 Int)) (and (let ((.cse14 (+ 41 v_main_~main__x~0_1659))) (or (and (< .cse14 main_~main__x~0) (< main_~main__x~0 92)) (= .cse14 main_~main__x~0))) (<= v_main_~main__x~0_1659 9))) (<= main_~main__y~0 91)) (and (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_786 Int)) (and (<= v_main_~main__x~0_786 9) (let ((.cse15 (+ v_main_~main__x~0_786 28))) (or (and (< main_~main__x~0 79) (< .cse15 main_~main__x~0)) (= .cse15 main_~main__x~0)))))) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_357 Int)) (and (or (= v_main_~main__x~0_357 main_~main__x~0) (and (< v_main_~main__x~0_357 main_~main__x~0) (< main_~main__x~0 51))) (<= v_main_~main__x~0_357 9)))) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= 98 main_~main__x~0) .cse0 (exists ((v_main_~main__x~0_1897 Int)) (and (<= v_main_~main__x~0_1897 9) (let ((.cse16 (+ v_main_~main__x~0_1897 48))) (or (= .cse16 main_~main__x~0) (and (< .cse16 main_~main__x~0) (< main_~main__x~0 99))))))) (and (<= 52 main_~main__y~0) (<= 52 main_~main__x~0) .cse0 (<= main_~main__y~0 52) (exists ((v_main_~main__x~0_216 Int)) (and (let ((.cse17 (+ 2 v_main_~main__x~0_216))) (or (and (< .cse17 main_~main__x~0) (< main_~main__x~0 53)) (= .cse17 main_~main__x~0))) (<= v_main_~main__x~0_216 9)))) (and (<= 65 main_~main__x~0) (<= 65 main_~main__y~0) .cse0 (<= main_~main__y~0 65) (exists ((v_main_~main__x~0_1602 Int)) (and (<= v_main_~main__x~0_1602 9) (let ((.cse18 (+ v_main_~main__x~0_1602 15))) (or (and (< .cse18 main_~main__x~0) (< main_~main__x~0 66)) (= .cse18 main_~main__x~0)))))) (and .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (exists ((v_main_~main__x~0_996 Int)) (and (let ((.cse19 (+ v_main_~main__x~0_996 4))) (or (and (< .cse19 main_~main__x~0) (< main_~main__x~0 55)) (= .cse19 main_~main__x~0))) (<= v_main_~main__x~0_996 9))) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 62) .cse0 (<= 62 main_~main__x~0) (<= 62 main_~main__y~0) (exists ((v_main_~main__x~0_709 Int)) (and (let ((.cse20 (+ v_main_~main__x~0_709 12))) (or (= .cse20 main_~main__x~0) (and (< main_~main__x~0 63) (< .cse20 main_~main__x~0)))) (<= v_main_~main__x~0_709 9)))) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) .cse0 (<= 89 main_~main__x~0) (exists ((v_main_~main__x~0_1332 Int)) (and (let ((.cse21 (+ v_main_~main__x~0_1332 39))) (or (= .cse21 main_~main__x~0) (and (< main_~main__x~0 90) (< .cse21 main_~main__x~0)))) (<= v_main_~main__x~0_1332 9)))) (and (<= main_~main__y~0 58) .cse0 (<= 58 main_~main__y~0) (<= 58 main_~main__x~0) (exists ((v_main_~main__x~0_534 Int)) (and (<= v_main_~main__x~0_534 9) (let ((.cse22 (+ v_main_~main__x~0_534 8))) (or (= .cse22 main_~main__x~0) (and (< main_~main__x~0 59) (< .cse22 main_~main__x~0))))))) (and (<= main_~main__y~0 51) .cse0 (<= 51 main_~main__y~0) (exists ((v_main_~main__x~0_1717 Int)) (and (<= v_main_~main__x~0_1717 9) (let ((.cse23 (+ v_main_~main__x~0_1717 1))) (or (= .cse23 main_~main__x~0) (and (< .cse23 main_~main__x~0) (< main_~main__x~0 52)))))) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 90) .cse0 (<= 90 main_~main__x~0) (exists ((v_main_~main__x~0_1491 Int)) (and (<= v_main_~main__x~0_1491 9) (let ((.cse24 (+ 40 v_main_~main__x~0_1491))) (or (and (< .cse24 main_~main__x~0) (< main_~main__x~0 91)) (= .cse24 main_~main__x~0))))) (<= 90 main_~main__y~0)) (and (<= 76 main_~main__x~0) .cse0 (<= main_~main__y~0 76) (<= 76 main_~main__y~0) (exists ((v_main_~main__x~0_1897 Int)) (and (let ((.cse25 (+ v_main_~main__x~0_1897 26))) (or (= .cse25 main_~main__x~0) (and (< .cse25 main_~main__x~0) (< main_~main__x~0 77)))) (<= v_main_~main__x~0_1897 9)))) (and (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= 61 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_672 Int)) (and (<= v_main_~main__x~0_672 9) (let ((.cse26 (+ v_main_~main__x~0_672 11))) (or (and (< .cse26 main_~main__x~0) (< main_~main__x~0 62)) (= .cse26 main_~main__x~0)))))) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) .cse0 (<= 57 main_~main__y~0) (exists ((v_main_~main__x~0_1041 Int)) (and (let ((.cse27 (+ 7 v_main_~main__x~0_1041))) (or (and (< .cse27 main_~main__x~0) (< main_~main__x~0 58)) (= .cse27 main_~main__x~0))) (<= v_main_~main__x~0_1041 9)))) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (exists ((v_main_~main__x~0_441 Int)) (and (<= v_main_~main__x~0_441 9) (let ((.cse28 (+ 5 v_main_~main__x~0_441))) (or (and (< main_~main__x~0 56) (< .cse28 main_~main__x~0)) (= .cse28 main_~main__x~0)))))) (and .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56) (exists ((v_main_~main__x~0_282 Int)) (and (let ((.cse29 (+ 6 v_main_~main__x~0_282))) (or (= .cse29 main_~main__x~0) (and (< .cse29 main_~main__x~0) (< main_~main__x~0 57)))) (<= v_main_~main__x~0_282 9)))) (and (<= 80 main_~main__y~0) .cse0 (<= main_~main__y~0 80) (exists ((v_main_~main__x~0_1491 Int)) (and (<= v_main_~main__x~0_1491 9) (let ((.cse30 (+ v_main_~main__x~0_1491 30))) (or (and (< .cse30 main_~main__x~0) (< main_~main__x~0 81)) (= .cse30 main_~main__x~0))))) (<= 80 main_~main__x~0)) (and (<= 70 main_~main__y~0) (<= 70 main_~main__x~0) (<= main_~main__y~0 70) .cse0 (exists ((v_main_~main__x~0_1491 Int)) (and (<= v_main_~main__x~0_1491 9) (let ((.cse31 (+ v_main_~main__x~0_1491 20))) (or (and (< .cse31 main_~main__x~0) (< main_~main__x~0 71)) (= .cse31 main_~main__x~0)))))) (and (<= main_~main__y~0 72) (<= 72 main_~main__x~0) (<= 72 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_952 Int)) (and (let ((.cse32 (+ 22 v_main_~main__x~0_952))) (or (and (< main_~main__x~0 73) (< .cse32 main_~main__x~0)) (= .cse32 main_~main__x~0))) (<= v_main_~main__x~0_952 9)))) (and (<= 82 main_~main__x~0) .cse0 (<= 82 main_~main__y~0) (<= main_~main__y~0 82) (exists ((v_main_~main__x~0_1717 Int)) (and (<= v_main_~main__x~0_1717 9) (let ((.cse33 (+ 32 v_main_~main__x~0_1717))) (or (and (< .cse33 main_~main__x~0) (< main_~main__x~0 83)) (= .cse33 main_~main__x~0)))))) (and (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59) (exists ((v_main_~main__x~0_1776 Int)) (and (let ((.cse34 (+ v_main_~main__x~0_1776 9))) (or (and (< .cse34 main_~main__x~0) (< main_~main__x~0 60)) (= .cse34 main_~main__x~0))) (<= v_main_~main__x~0_1776 9)))) (and (<= 87 main_~main__x~0) (<= 87 main_~main__y~0) (<= main_~main__y~0 87) .cse0 (exists ((v_main_~main__x~0_1491 Int)) (and (<= v_main_~main__x~0_1491 9) (let ((.cse35 (+ v_main_~main__x~0_1491 37))) (or (and (< .cse35 main_~main__x~0) (< main_~main__x~0 88)) (= .cse35 main_~main__x~0)))))) (and (<= main_~main__y~0 97) (<= 97 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_1776 Int)) (and (<= v_main_~main__x~0_1776 9) (let ((.cse36 (+ v_main_~main__x~0_1776 47))) (or (= .cse36 main_~main__x~0) (and (< .cse36 main_~main__x~0) (< main_~main__x~0 98)))))) (<= 97 main_~main__x~0)) (and (<= main_~main__y~0 85) (<= 85 main_~main__x~0) .cse0 (<= 85 main_~main__y~0) (exists ((v_main_~main__x~0_1602 Int)) (and (<= v_main_~main__x~0_1602 9) (let ((.cse37 (+ 35 v_main_~main__x~0_1602))) (or (and (< main_~main__x~0 86) (< .cse37 main_~main__x~0)) (= .cse37 main_~main__x~0)))))) (and (<= 77 main_~main__x~0) (<= main_~main__y~0 77) .cse0 (<= 77 main_~main__y~0) (exists ((v_main_~main__x~0_747 Int)) (and (<= v_main_~main__x~0_747 9) (let ((.cse38 (+ v_main_~main__x~0_747 27))) (or (= .cse38 main_~main__x~0) (and (< .cse38 main_~main__x~0) (< main_~main__x~0 78))))))) (and (<= main_~main__y~0 68) (<= 68 main_~main__y~0) (<= 68 main_~main__x~0) .cse0 (exists ((v_main_~main__x~0_1182 Int)) (and (<= v_main_~main__x~0_1182 9) (let ((.cse39 (+ v_main_~main__x~0_1182 18))) (or (= .cse39 main_~main__x~0) (and (< main_~main__x~0 69) (< .cse39 main_~main__x~0))))))) (and (<= 73 main_~main__y~0) .cse0 (<= main_~main__y~0 73) (<= 73 main_~main__x~0) (exists ((v_main_~main__x~0_1546 Int)) (and (<= v_main_~main__x~0_1546 9) (let ((.cse40 (+ 23 v_main_~main__x~0_1546))) (or (and (< main_~main__x~0 74) (< .cse40 main_~main__x~0)) (= main_~main__x~0 .cse40)))))) (and (<= main_~main__y~0 79) .cse0 (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (exists ((v_main_~main__x~0_1134 Int)) (and (<= v_main_~main__x~0_1134 9) (let ((.cse41 (+ 29 v_main_~main__x~0_1134))) (or (and (< main_~main__x~0 80) (< .cse41 main_~main__x~0)) (= .cse41 main_~main__x~0)))))) (and (<= 81 main_~main__x~0) (<= main_~main__y~0 81) (<= 81 main_~main__y~0) .cse0 (exists ((v_main_~main__x~0_1041 Int)) (and (<= v_main_~main__x~0_1041 9) (let ((.cse42 (+ v_main_~main__x~0_1041 31))) (or (= .cse42 main_~main__x~0) (and (< .cse42 main_~main__x~0) (< main_~main__x~0 82))))))) (and (<= 94 main_~main__y~0) (<= main_~main__y~0 94) .cse0 (<= 94 main_~main__x~0) (exists ((v_main_~main__x~0_1659 Int)) (and (let ((.cse43 (+ 44 v_main_~main__x~0_1659))) (or (and (< main_~main__x~0 95) (< .cse43 main_~main__x~0)) (= main_~main__x~0 .cse43))) (<= v_main_~main__x~0_1659 9)))) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__y~0 63) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse44 (+ v_main_~main__x~0_1546 13))) (or (= .cse44 main_~main__x~0) (and (< main_~main__x~0 64) (< .cse44 main_~main__x~0)))) (<= v_main_~main__x~0_1546 9)))) (and (<= 71 main_~main__y~0) (<= main_~main__y~0 71) .cse0 (<= 71 main_~main__x~0) (exists ((v_main_~main__x~0_1087 Int)) (and (let ((.cse45 (+ v_main_~main__x~0_1087 21))) (or (and (< .cse45 main_~main__x~0) (< main_~main__x~0 72)) (= .cse45 main_~main__x~0))) (<= v_main_~main__x~0_1087 9)))) (and (<= 86 main_~main__x~0) (<= 86 main_~main__y~0) .cse0 (<= main_~main__y~0 86) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse46 (+ v_main_~main__x~0_1546 36))) (or (and (< .cse46 main_~main__x~0) (< main_~main__x~0 87)) (= .cse46 main_~main__x~0))) (<= v_main_~main__x~0_1546 9)))) (and (<= 74 main_~main__y~0) (<= 74 main_~main__x~0) .cse0 (<= main_~main__y~0 74) (exists ((v_main_~main__x~0_1182 Int)) (and (let ((.cse47 (+ v_main_~main__x~0_1182 24))) (or (= .cse47 main_~main__x~0) (and (< main_~main__x~0 75) (< .cse47 main_~main__x~0)))) (<= v_main_~main__x~0_1182 9)))) (and (<= main_~main__y~0 67) (<= 67 main_~main__y~0) .cse0 (<= 67 main_~main__x~0) (exists ((v_main_~main__x~0_1231 Int)) (and (let ((.cse48 (+ v_main_~main__x~0_1231 17))) (or (and (< .cse48 main_~main__x~0) (< main_~main__x~0 68)) (= .cse48 main_~main__x~0))) (<= v_main_~main__x~0_1231 9)))) (and (<= 93 main_~main__y~0) .cse0 (<= 93 main_~main__x~0) (<= main_~main__y~0 93) (exists ((v_main_~main__x~0_1546 Int)) (and (let ((.cse49 (+ v_main_~main__x~0_1546 43))) (or (and (< main_~main__x~0 94) (< .cse49 main_~main__x~0)) (= .cse49 main_~main__x~0))) (<= v_main_~main__x~0_1546 9)))))) [2022-02-15 01:37:57,149 INFO L854 garLoopResultBuilder]: At program point L37(lines 37 172) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 3)) [2022-02-15 01:37:57,149 INFO L854 garLoopResultBuilder]: At program point L25(lines 25 196) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 1)) [2022-02-15 01:37:57,149 INFO L854 garLoopResultBuilder]: At program point L17(lines 17 213) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (= main_~main__x~0 0)) [2022-02-15 01:37:57,149 INFO L854 garLoopResultBuilder]: At program point L207(lines 19 208) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 1)) [2022-02-15 01:37:57,149 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 13 214) the Hoare annotation is: true [2022-02-15 01:37:57,149 INFO L854 garLoopResultBuilder]: At program point L67(lines 67 112) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 8) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,150 INFO L854 garLoopResultBuilder]: At program point L195(lines 25 196) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,150 INFO L854 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: false [2022-02-15 01:37:57,150 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 96) the Hoare annotation is: false [2022-02-15 01:37:57,150 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 13 214) the Hoare annotation is: (= |old(~__return_720~0)| ~__return_720~0) [2022-02-15 01:37:57,150 INFO L854 garLoopResultBuilder]: At program point L55(lines 55 136) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 6)) [2022-02-15 01:37:57,150 INFO L854 garLoopResultBuilder]: At program point L183(lines 31 184) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 3)) [2022-02-15 01:37:57,151 INFO L854 garLoopResultBuilder]: At program point L43(lines 43 160) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 4) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,151 INFO L854 garLoopResultBuilder]: At program point L171(lines 37 172) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 4) (= |old(~__return_720~0)| ~__return_720~0)) [2022-02-15 01:37:57,151 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 01:37:57,151 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_720~0)| ~__return_720~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 01:37:57,151 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 01:37:57,151 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 01:37:57,151 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 01:37:57,151 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 01:37:57,151 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 01:37:57,153 INFO L732 BasicCegarLoop]: Path program histogram: [51, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:37:57,154 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 01:37:57,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:37:57 BoogieIcfgContainer [2022-02-15 01:37:57,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 01:37:57,236 INFO L158 Benchmark]: Toolchain (without parser) took 152512.25ms. Allocated memory was 168.8MB in the beginning and 720.4MB in the end (delta: 551.6MB). Free memory was 122.4MB in the beginning and 573.5MB in the end (delta: -451.1MB). Peak memory consumption was 415.0MB. Max. memory is 8.0GB. [2022-02-15 01:37:57,236 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 168.8MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 01:37:57,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.82ms. Allocated memory is still 168.8MB. Free memory was 122.2MB in the beginning and 148.2MB in the end (delta: -26.0MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-02-15 01:37:57,236 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 168.8MB. Free memory was 148.2MB in the beginning and 146.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 01:37:57,236 INFO L158 Benchmark]: RCFGBuilder took 269.67ms. Allocated memory is still 168.8MB. Free memory was 146.7MB in the beginning and 134.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-15 01:37:57,236 INFO L158 Benchmark]: TraceAbstraction took 151928.79ms. Allocated memory was 168.8MB in the beginning and 720.4MB in the end (delta: 551.6MB). Free memory was 133.6MB in the beginning and 573.5MB in the end (delta: -440.0MB). Peak memory consumption was 425.9MB. Max. memory is 8.0GB. [2022-02-15 01:37:57,237 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.14ms. Allocated memory is still 168.8MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.82ms. Allocated memory is still 168.8MB. Free memory was 122.2MB in the beginning and 148.2MB in the end (delta: -26.0MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 168.8MB. Free memory was 148.2MB in the beginning and 146.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 269.67ms. Allocated memory is still 168.8MB. Free memory was 146.7MB in the beginning and 134.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 151928.79ms. Allocated memory was 168.8MB in the beginning and 720.4MB in the end (delta: 551.6MB). Free memory was 133.6MB in the beginning and 573.5MB in the end (delta: -440.0MB). Peak memory consumption was 425.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] * 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 - PositiveResult [Line: 96]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 151.8s, OverallIterations: 59, TraceHistogramMax: 52, PathProgramHistogramMax: 51, EmptinessCheckTime: 0.0s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1755 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1755 mSDsluCounter, 11253 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28138 IncrementalHoareTripleChecker+Unchecked, 10685 mSDsCounter, 1258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4209 IncrementalHoareTripleChecker+Invalid, 33605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1258 mSolverCounterUnsat, 568 mSDtfsCounter, 4209 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4510 GetRequests, 399 SyntacticMatches, 1427 SemanticMatches, 2684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37758 ImplicationChecksByTransitivity, 104.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=58, InterpolantAutomatonStates: 2151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 59 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 159 NumberOfFragments, 3592 HoareAnnotationTreeSize, 33 FomulaSimplifications, 359 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 53264 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 3 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 4) && \old(__return_720) == __return_720 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__x <= 7 && main__y <= 50) && 50 <= main__y) && \old(__return_720) == __return_720 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 5 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 6 - InvariantResult [Line: 67]: Loop Invariant [2022-02-15 01:37:57,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,262 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,263 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,264 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,265 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,266 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_84,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_384,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1332,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1836,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_786,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_357,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_996,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_709,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_534,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1897,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_672,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_441,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_282,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1491,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_952,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1231,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,284 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1717,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1776,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1602,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_747,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1134,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1041,QUANTIFIED] [2022-02-15 01:37:57,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1659,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_826,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1087,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1182,QUANTIFIED] [2022-02-15 01:37:57,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] [2022-02-15 01:37:57,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~main__x~0_1546,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((main__y <= 88 && \old(__return_720) == __return_720) && 88 <= main__y) && (\exists v_main_~main__x~0_1546 : int :: (v_main_~main__x~0_1546 + 38 == main__x || (v_main_~main__x~0_1546 + 38 < main__x && main__x < 89)) && v_main_~main__x~0_1546 <= 9)) && 88 <= main__x) || ((((main__y <= 69 && 69 <= main__y) && \old(__return_720) == __return_720) && 69 <= main__x) && (\exists v_main_~main__x~0_1041 : int :: (19 + v_main_~main__x~0_1041 == main__x || (main__x < 70 && 19 + v_main_~main__x~0_1041 < main__x)) && v_main_~main__x~0_1041 <= 9))) || ((((95 <= main__y && \old(__return_720) == __return_720) && main__y <= 95) && 95 <= main__x) && (\exists v_main_~main__x~0_1897 : int :: ((main__x < 96 && v_main_~main__x~0_1897 + 45 < main__x) || v_main_~main__x~0_1897 + 45 == main__x) && v_main_~main__x~0_1897 <= 9))) || ((((main__y <= 97 && 97 <= main__y) && \old(__return_720) == __return_720) && 97 <= main__x) && (\exists v_main_~main__x~0_1659 : int :: ((v_main_~main__x~0_1659 + 47 < main__x && main__x < 98) || v_main_~main__x~0_1659 + 47 == main__x) && v_main_~main__x~0_1659 <= 9))) || ((((main__y <= 67 && 67 <= main__y) && \old(__return_720) == __return_720) && 67 <= main__x) && (\exists v_main_~main__x~0_384 : int :: v_main_~main__x~0_384 <= 9 && ((v_main_~main__x~0_384 + 17 < main__x && main__x < 68) || v_main_~main__x~0_384 + 17 == main__x)))) || ((((75 <= main__x && main__y <= 75) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_826 : int :: v_main_~main__x~0_826 <= 9 && (v_main_~main__x~0_826 + 25 == main__x || (v_main_~main__x~0_826 + 25 < main__x && main__x < 76)))) && 75 <= main__y)) || ((((96 <= main__x && \old(__return_720) == __return_720) && main__y <= 96) && 96 <= main__y) && (\exists v_main_~main__x~0_1897 : int :: v_main_~main__x~0_1897 <= 9 && ((main__x < 97 && v_main_~main__x~0_1897 + 46 < main__x) || v_main_~main__x~0_1897 + 46 == main__x)))) || ((((83 <= main__y && main__y <= 83) && \old(__return_720) == __return_720) && 83 <= main__x) && (\exists v_main_~main__x~0_1182 : int :: (v_main_~main__x~0_1182 + 33 == main__x || (main__x < 84 && v_main_~main__x~0_1182 + 33 < main__x)) && v_main_~main__x~0_1182 <= 9))) || ((((52 <= main__y && 52 <= main__x) && \old(__return_720) == __return_720) && main__y <= 52) && (\exists v_main_~main__x~0_84 : int :: v_main_~main__x~0_84 <= 9 && (2 + v_main_~main__x~0_84 == main__x || (2 + v_main_~main__x~0_84 < main__x && main__x < 53))))) || ((((main__y <= 66 && \old(__return_720) == __return_720) && 66 <= main__x) && 66 <= main__y) && (\exists v_main_~main__x~0_441 : int :: v_main_~main__x~0_441 <= 9 && ((16 + v_main_~main__x~0_441 < main__x && main__x < 67) || main__x == 16 + v_main_~main__x~0_441)))) || ((((53 <= main__y && main__y <= 53) && \old(__return_720) == __return_720) && 53 <= main__x) && (\exists v_main_~main__x~0_384 : int :: v_main_~main__x~0_384 <= 9 && ((3 + v_main_~main__x~0_384 < main__x && main__x < 54) || 3 + v_main_~main__x~0_384 == main__x)))) || ((((main__y <= 60 && 60 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_534 : int :: ((v_main_~main__x~0_534 + 10 < main__x && main__x < 61) || v_main_~main__x~0_534 + 10 == main__x) && v_main_~main__x~0_534 <= 9)) && 60 <= main__x)) || ((((64 <= main__y && \old(__return_720) == __return_720) && main__y <= 64) && (\exists v_main_~main__x~0_1332 : int :: (v_main_~main__x~0_1332 + 14 == main__x || (v_main_~main__x~0_1332 + 14 < main__x && main__x < 65)) && v_main_~main__x~0_1332 <= 9)) && 64 <= main__x)) || ((((92 <= main__x && 92 <= main__y) && \old(__return_720) == __return_720) && main__y <= 92) && (\exists v_main_~main__x~0_1776 : int :: ((v_main_~main__x~0_1776 + 42 < main__x && main__x < 93) || v_main_~main__x~0_1776 + 42 == main__x) && v_main_~main__x~0_1776 <= 9))) || ((((91 <= main__y && 91 <= main__x) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1332 : int :: ((main__x < 92 && 41 + v_main_~main__x~0_1332 < main__x) || 41 + v_main_~main__x~0_1332 == main__x) && v_main_~main__x~0_1332 <= 9)) && main__y <= 91)) || ((((100 <= main__x && (\exists v_main_~main__x~0_1836 : int :: v_main_~main__x~0_1836 <= 9 && (main__x == v_main_~main__x~0_1836 + 50 || (main__x < 101 && v_main_~main__x~0_1836 + 50 < main__x)))) && \old(__return_720) == __return_720) && 100 <= main__y) && main__y <= 100)) || ((((main__y <= 84 && 84 <= main__x) && 84 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1087 : int :: (v_main_~main__x~0_1087 + 34 == main__x || (v_main_~main__x~0_1087 + 34 < main__x && main__x < 85)) && v_main_~main__x~0_1087 <= 9))) || ((((main__y <= 78 && 78 <= main__x) && 78 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_786 : int :: v_main_~main__x~0_786 <= 9 && ((main__x < 79 && v_main_~main__x~0_786 + 28 < main__x) || v_main_~main__x~0_786 + 28 == main__x)))) || (((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_357 : int :: (v_main_~main__x~0_357 == main__x || (v_main_~main__x~0_357 < main__x && main__x < 51)) && v_main_~main__x~0_357 <= 9))) || ((((main__y <= 98 && 98 <= main__y) && 98 <= main__x) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1897 : int :: v_main_~main__x~0_1897 <= 9 && (v_main_~main__x~0_1897 + 48 == main__x || (v_main_~main__x~0_1897 + 48 < main__x && main__x < 99))))) || ((((65 <= main__x && 65 <= main__y) && \old(__return_720) == __return_720) && main__y <= 65) && (\exists v_main_~main__x~0_1602 : int :: v_main_~main__x~0_1602 <= 9 && ((v_main_~main__x~0_1602 + 15 < main__x && main__x < 66) || v_main_~main__x~0_1602 + 15 == main__x)))) || ((((\old(__return_720) == __return_720 && 54 <= main__y) && main__y <= 54) && (\exists v_main_~main__x~0_996 : int :: ((v_main_~main__x~0_996 + 4 < main__x && main__x < 55) || v_main_~main__x~0_996 + 4 == main__x) && v_main_~main__x~0_996 <= 9)) && 54 <= main__x)) || ((((main__y <= 62 && \old(__return_720) == __return_720) && 62 <= main__x) && 62 <= main__y) && (\exists v_main_~main__x~0_709 : int :: (v_main_~main__x~0_709 + 12 == main__x || (main__x < 63 && v_main_~main__x~0_709 + 12 < main__x)) && v_main_~main__x~0_709 <= 9))) || ((((main__y <= 58 && \old(__return_720) == __return_720) && 58 <= main__y) && 58 <= main__x) && (\exists v_main_~main__x~0_534 : int :: v_main_~main__x~0_534 <= 9 && (v_main_~main__x~0_534 + 8 == main__x || (main__x < 59 && v_main_~main__x~0_534 + 8 < main__x))))) || ((((main__y <= 51 && \old(__return_720) == __return_720) && 51 <= main__y) && (\exists v_main_~main__x~0_1717 : int :: v_main_~main__x~0_1717 <= 9 && (v_main_~main__x~0_1717 + 1 == main__x || (v_main_~main__x~0_1717 + 1 < main__x && main__x < 52)))) && 51 <= main__x)) || ((((main__y <= 90 && \old(__return_720) == __return_720) && 90 <= main__x) && (\exists v_main_~main__x~0_1491 : int :: v_main_~main__x~0_1491 <= 9 && ((40 + v_main_~main__x~0_1491 < main__x && main__x < 91) || 40 + v_main_~main__x~0_1491 == main__x))) && 90 <= main__y)) || ((((76 <= main__x && \old(__return_720) == __return_720) && main__y <= 76) && 76 <= main__y) && (\exists v_main_~main__x~0_1897 : int :: (v_main_~main__x~0_1897 + 26 == main__x || (v_main_~main__x~0_1897 + 26 < main__x && main__x < 77)) && v_main_~main__x~0_1897 <= 9))) || ((((61 <= main__x && main__y <= 61) && 61 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_672 : int :: v_main_~main__x~0_672 <= 9 && ((v_main_~main__x~0_672 + 11 < main__x && main__x < 62) || v_main_~main__x~0_672 + 11 == main__x)))) || ((((main__y <= 99 && (\exists v_main_~main__x~0_1776 : int :: (49 + v_main_~main__x~0_1776 == main__x || (main__x < 100 && 49 + v_main_~main__x~0_1776 < main__x)) && v_main_~main__x~0_1776 <= 9)) && 99 <= main__y) && \old(__return_720) == __return_720) && 99 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && \old(__return_720) == __return_720) && 57 <= main__y) && (\exists v_main_~main__x~0_1041 : int :: ((7 + v_main_~main__x~0_1041 < main__x && main__x < 58) || 7 + v_main_~main__x~0_1041 == main__x) && v_main_~main__x~0_1041 <= 9))) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_441 : int :: v_main_~main__x~0_441 <= 9 && ((main__x < 56 && 5 + v_main_~main__x~0_441 < main__x) || 5 + v_main_~main__x~0_441 == main__x)))) || ((((\old(__return_720) == __return_720 && 56 <= main__x) && 56 <= main__y) && main__y <= 56) && (\exists v_main_~main__x~0_282 : int :: (6 + v_main_~main__x~0_282 == main__x || (6 + v_main_~main__x~0_282 < main__x && main__x < 57)) && v_main_~main__x~0_282 <= 9))) || ((((70 <= main__y && 70 <= main__x) && main__y <= 70) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1491 : int :: v_main_~main__x~0_1491 <= 9 && ((v_main_~main__x~0_1491 + 20 < main__x && main__x < 71) || v_main_~main__x~0_1491 + 20 == main__x)))) || ((((main__y <= 72 && 72 <= main__x) && 72 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_952 : int :: ((main__x < 73 && 22 + v_main_~main__x~0_952 < main__x) || 22 + v_main_~main__x~0_952 == main__x) && v_main_~main__x~0_952 <= 9))) || ((((89 <= main__y && main__y <= 89) && \old(__return_720) == __return_720) && 89 <= main__x) && (\exists v_main_~main__x~0_1231 : int :: ((v_main_~main__x~0_1231 + 39 < main__x && main__x < 90) || main__x == v_main_~main__x~0_1231 + 39) && v_main_~main__x~0_1231 <= 9))) || ((((82 <= main__x && \old(__return_720) == __return_720) && 82 <= main__y) && main__y <= 82) && (\exists v_main_~main__x~0_1717 : int :: v_main_~main__x~0_1717 <= 9 && ((32 + v_main_~main__x~0_1717 < main__x && main__x < 83) || 32 + v_main_~main__x~0_1717 == main__x)))) || ((((59 <= main__x && 59 <= main__y) && \old(__return_720) == __return_720) && main__y <= 59) && (\exists v_main_~main__x~0_1776 : int :: ((v_main_~main__x~0_1776 + 9 < main__x && main__x < 60) || v_main_~main__x~0_1776 + 9 == main__x) && v_main_~main__x~0_1776 <= 9))) || ((((main__y <= 85 && 85 <= main__x) && \old(__return_720) == __return_720) && 85 <= main__y) && (\exists v_main_~main__x~0_1602 : int :: v_main_~main__x~0_1602 <= 9 && ((main__x < 86 && 35 + v_main_~main__x~0_1602 < main__x) || 35 + v_main_~main__x~0_1602 == main__x)))) || ((((77 <= main__x && main__y <= 77) && \old(__return_720) == __return_720) && 77 <= main__y) && (\exists v_main_~main__x~0_747 : int :: v_main_~main__x~0_747 <= 9 && (v_main_~main__x~0_747 + 27 == main__x || (v_main_~main__x~0_747 + 27 < main__x && main__x < 78))))) || ((((main__y <= 68 && 68 <= main__y) && 68 <= main__x) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1182 : int :: v_main_~main__x~0_1182 <= 9 && (v_main_~main__x~0_1182 + 18 == main__x || (main__x < 69 && v_main_~main__x~0_1182 + 18 < main__x))))) || ((((73 <= main__y && \old(__return_720) == __return_720) && main__y <= 73) && 73 <= main__x) && (\exists v_main_~main__x~0_1546 : int :: v_main_~main__x~0_1546 <= 9 && ((main__x < 74 && 23 + v_main_~main__x~0_1546 < main__x) || main__x == 23 + v_main_~main__x~0_1546)))) || ((((87 <= main__x && 87 <= main__y) && main__y <= 87) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1134 : int :: v_main_~main__x~0_1134 <= 9 && (v_main_~main__x~0_1134 + 37 == main__x || (v_main_~main__x~0_1134 + 37 < main__x && main__x < 88))))) || ((((main__y <= 79 && \old(__return_720) == __return_720) && 79 <= main__x) && 79 <= main__y) && (\exists v_main_~main__x~0_1134 : int :: v_main_~main__x~0_1134 <= 9 && ((main__x < 80 && 29 + v_main_~main__x~0_1134 < main__x) || 29 + v_main_~main__x~0_1134 == main__x)))) || ((((81 <= main__x && main__y <= 81) && 81 <= main__y) && \old(__return_720) == __return_720) && (\exists v_main_~main__x~0_1041 : int :: v_main_~main__x~0_1041 <= 9 && (v_main_~main__x~0_1041 + 31 == main__x || (v_main_~main__x~0_1041 + 31 < main__x && main__x < 82))))) || ((((94 <= main__y && main__y <= 94) && \old(__return_720) == __return_720) && 94 <= main__x) && (\exists v_main_~main__x~0_1659 : int :: ((main__x < 95 && 44 + v_main_~main__x~0_1659 < main__x) || main__x == 44 + v_main_~main__x~0_1659) && v_main_~main__x~0_1659 <= 9))) || ((((63 <= main__y && 63 <= main__x) && \old(__return_720) == __return_720) && main__y <= 63) && (\exists v_main_~main__x~0_1546 : int :: (v_main_~main__x~0_1546 + 13 == main__x || (main__x < 64 && v_main_~main__x~0_1546 + 13 < main__x)) && v_main_~main__x~0_1546 <= 9))) || ((((80 <= main__y && \old(__return_720) == __return_720) && main__y <= 80) && 80 <= main__x) && (\exists v_main_~main__x~0_826 : int :: v_main_~main__x~0_826 <= 9 && (30 + v_main_~main__x~0_826 == main__x || (main__x < 81 && 30 + v_main_~main__x~0_826 < main__x))))) || ((((71 <= main__y && main__y <= 71) && \old(__return_720) == __return_720) && 71 <= main__x) && (\exists v_main_~main__x~0_1087 : int :: ((v_main_~main__x~0_1087 + 21 < main__x && main__x < 72) || v_main_~main__x~0_1087 + 21 == main__x) && v_main_~main__x~0_1087 <= 9))) || ((((86 <= main__x && 86 <= main__y) && \old(__return_720) == __return_720) && main__y <= 86) && (\exists v_main_~main__x~0_1546 : int :: ((v_main_~main__x~0_1546 + 36 < main__x && main__x < 87) || v_main_~main__x~0_1546 + 36 == main__x) && v_main_~main__x~0_1546 <= 9))) || ((((74 <= main__y && 74 <= main__x) && \old(__return_720) == __return_720) && main__y <= 74) && (\exists v_main_~main__x~0_1182 : int :: (v_main_~main__x~0_1182 + 24 == main__x || (main__x < 75 && v_main_~main__x~0_1182 + 24 < main__x)) && v_main_~main__x~0_1182 <= 9))) || ((((93 <= main__y && \old(__return_720) == __return_720) && 93 <= main__x) && main__y <= 93) && (\exists v_main_~main__x~0_1546 : int :: ((main__x < 94 && v_main_~main__x~0_1546 + 43 < main__x) || v_main_~main__x~0_1546 + 43 == main__x) && v_main_~main__x~0_1546 <= 9)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 1 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 8) && \old(__return_720) == __return_720 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 2) && \old(__return_720) == __return_720 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-02-15 01:37:57,493 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-15 01:37:57,516 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 137 Received shutdown request...